java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/abstractInterpretation/regression/open/comp/recursive-CallABAB_simple_incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:09:27,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:09:27,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:09:27,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:09:27,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:09:27,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:09:27,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:09:27,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:09:27,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:09:27,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:09:27,286 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:09:27,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:09:27,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:09:27,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:09:27,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:09:27,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:09:27,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:09:27,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:09:27,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:09:27,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:09:27,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:09:27,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:09:27,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:09:27,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:09:27,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:09:27,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:09:27,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:09:27,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:09:27,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:09:27,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:09:27,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:09:27,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:09:27,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:09:27,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:09:27,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:09:27,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:09:27,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:09:27,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:09:27,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:09:27,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:09:27,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:09:27,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:09:27,364 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:09:27,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:09:27,369 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:09:27,370 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:09:27,371 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/comp/recursive-CallABAB_simple_incorrect.bpl [2019-08-05 11:09:27,371 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/comp/recursive-CallABAB_simple_incorrect.bpl' [2019-08-05 11:09:27,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:09:27,408 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:09:27,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:27,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:09:27,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:09:27,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:27,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:09:27,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:09:27,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:09:27,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:09:27,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:09:27,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:09:27,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:09:27,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:09:27,546 INFO L124 BoogieDeclarations]: Specification and implementation of procedure funA given in one single declaration [2019-08-05 11:09:27,547 INFO L130 BoogieDeclarations]: Found specification of procedure funA [2019-08-05 11:09:27,547 INFO L138 BoogieDeclarations]: Found implementation of procedure funA [2019-08-05 11:09:27,547 INFO L124 BoogieDeclarations]: Specification and implementation of procedure funB given in one single declaration [2019-08-05 11:09:27,547 INFO L130 BoogieDeclarations]: Found specification of procedure funB [2019-08-05 11:09:27,548 INFO L138 BoogieDeclarations]: Found implementation of procedure funB [2019-08-05 11:09:27,548 INFO L124 BoogieDeclarations]: Specification and implementation of procedure dispatch given in one single declaration [2019-08-05 11:09:27,548 INFO L130 BoogieDeclarations]: Found specification of procedure dispatch [2019-08-05 11:09:27,548 INFO L138 BoogieDeclarations]: Found implementation of procedure dispatch [2019-08-05 11:09:27,549 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:09:27,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:09:27,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:09:27,780 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:09:27,780 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:09:27,781 INFO L202 PluginConnector]: Adding new model recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:27 BoogieIcfgContainer [2019-08-05 11:09:27,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:09:27,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:09:27,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:09:27,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:09:27,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/2) ... [2019-08-05 11:09:27,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdd447c and model type recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:09:27, skipping insertion in model container [2019-08-05 11:09:27,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:27" (2/2) ... [2019-08-05 11:09:27,790 INFO L109 eAbstractionObserver]: Analyzing ICFG recursive-CallABAB_simple_incorrect.bpl [2019-08-05 11:09:27,800 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:09:27,807 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:09:27,824 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:09:27,857 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:09:27,858 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:09:27,858 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:09:27,858 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:09:27,858 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:09:27,858 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:09:27,859 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:09:27,859 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:09:27,859 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:09:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-08-05 11:09:27,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:09:27,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:27,890 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:09:27,893 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:27,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:27,900 INFO L82 PathProgramCache]: Analyzing trace with hash 53757302, now seen corresponding path program 1 times [2019-08-05 11:09:27,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:27,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:09:27,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:28,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:28,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:09:28,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:28,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:28,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:28,055 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-08-05 11:09:28,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:28,202 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-08-05 11:09:28,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:28,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:09:28,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:28,218 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:09:28,219 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:09:28,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:09:28,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:09:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:09:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-08-05 11:09:28,265 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 5 [2019-08-05 11:09:28,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:28,265 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-08-05 11:09:28,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2019-08-05 11:09:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:09:28,268 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:28,268 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:28,269 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:28,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:28,269 INFO L82 PathProgramCache]: Analyzing trace with hash 977678664, now seen corresponding path program 1 times [2019-08-05 11:09:28,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:28,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:09:28,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:09:28,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:28,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:09:28,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:09:28,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:09:28,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:28,395 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand 5 states. [2019-08-05 11:09:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:28,504 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-08-05 11:09:28,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:09:28,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-08-05 11:09:28,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:28,507 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:09:28,508 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:09:28,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:28,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:09:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:09:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:09:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-08-05 11:09:28,517 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2019-08-05 11:09:28,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:28,518 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-08-05 11:09:28,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:09:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-08-05 11:09:28,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:09:28,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:28,520 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:28,521 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:28,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:28,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1323874950, now seen corresponding path program 1 times [2019-08-05 11:09:28,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:28,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:09:28,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:09:28,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:28,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:09:28,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:09:28,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:09:28,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:28,613 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2019-08-05 11:09:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:28,715 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-08-05 11:09:28,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:09:28,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-08-05 11:09:28,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:28,716 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:09:28,717 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:09:28,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:09:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-08-05 11:09:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:09:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-08-05 11:09:28,724 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2019-08-05 11:09:28,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:28,724 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-08-05 11:09:28,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:09:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-08-05 11:09:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:09:28,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:28,726 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:28,726 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:28,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:28,727 INFO L82 PathProgramCache]: Analyzing trace with hash 703513180, now seen corresponding path program 2 times [2019-08-05 11:09:28,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:28,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:09:28,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 11:09:28,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:28,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:09:28,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:09:28,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:09:28,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:28,979 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 7 states. [2019-08-05 11:09:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:29,121 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-08-05 11:09:29,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:09:29,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-08-05 11:09:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:29,123 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:09:29,124 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:09:29,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:09:29,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-08-05 11:09:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:09:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-08-05 11:09:29,131 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 19 [2019-08-05 11:09:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:29,131 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-08-05 11:09:29,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:09:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2019-08-05 11:09:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:09:29,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:29,133 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:29,133 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:29,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:29,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1846738150, now seen corresponding path program 1 times [2019-08-05 11:09:29,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:29,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:09:29,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:09:29,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:29,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:09:29,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:09:29,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:09:29,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:29,261 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 7 states. [2019-08-05 11:09:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:29,341 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-08-05 11:09:29,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:09:29,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-08-05 11:09:29,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:29,343 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:09:29,343 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:09:29,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:09:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-08-05 11:09:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:09:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-08-05 11:09:29,352 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 19 [2019-08-05 11:09:29,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:29,352 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-08-05 11:09:29,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:09:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2019-08-05 11:09:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:09:29,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:29,354 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:29,354 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:29,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:29,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1416725350, now seen corresponding path program 2 times [2019-08-05 11:09:29,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:29,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:09:29,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:09:29,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:29,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:09:29,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:09:29,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:09:29,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:29,659 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 7 states. [2019-08-05 11:09:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:29,732 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-08-05 11:09:29,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:09:29,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-08-05 11:09:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:29,734 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:09:29,734 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:09:29,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:09:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-08-05 11:09:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:09:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-08-05 11:09:29,744 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 19 [2019-08-05 11:09:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:29,744 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-08-05 11:09:29,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:09:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2019-08-05 11:09:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:09:29,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:29,746 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:29,746 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:29,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:29,746 INFO L82 PathProgramCache]: Analyzing trace with hash 327990616, now seen corresponding path program 2 times [2019-08-05 11:09:29,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:29,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:09:29,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 11:09:29,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:29,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:09:29,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:09:29,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:09:29,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:29,844 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 7 states. [2019-08-05 11:09:29,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:29,890 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-08-05 11:09:29,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:09:29,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-08-05 11:09:29,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:29,893 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:09:29,893 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:09:29,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:29,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:09:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-08-05 11:09:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:09:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-08-05 11:09:29,900 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 19 [2019-08-05 11:09:29,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:29,900 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-08-05 11:09:29,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:09:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-08-05 11:09:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:09:29,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:29,902 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:29,902 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2038194962, now seen corresponding path program 3 times [2019-08-05 11:09:29,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:29,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:09:29,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-05 11:09:30,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:30,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:09:30,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:09:30,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:09:30,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:30,282 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 9 states. [2019-08-05 11:09:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:30,323 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-08-05 11:09:30,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:09:30,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 11:09:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:30,325 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:09:30,325 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:09:30,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:09:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-08-05 11:09:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:09:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-08-05 11:09:30,333 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 26 [2019-08-05 11:09:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:30,333 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-08-05 11:09:30,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:09:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2019-08-05 11:09:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:09:30,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:30,335 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:30,335 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:30,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:30,335 INFO L82 PathProgramCache]: Analyzing trace with hash 376485420, now seen corresponding path program 3 times [2019-08-05 11:09:30,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:30,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:09:30,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:09:30,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:30,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:09:30,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:09:30,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:09:30,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:30,497 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 9 states. [2019-08-05 11:09:30,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:30,577 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-08-05 11:09:30,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:09:30,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 11:09:30,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:30,580 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:09:30,580 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:09:30,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:09:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2019-08-05 11:09:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:09:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-08-05 11:09:30,591 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 26 [2019-08-05 11:09:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:30,592 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-08-05 11:09:30,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:09:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-08-05 11:09:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:09:30,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:30,596 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:30,596 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:30,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:30,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1339510444, now seen corresponding path program 4 times [2019-08-05 11:09:30,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:30,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:09:30,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:09:30,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:30,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:09:30,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:09:30,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:09:30,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:30,763 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 9 states. [2019-08-05 11:09:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:30,866 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2019-08-05 11:09:30,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:09:30,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 11:09:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:30,869 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:09:30,869 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:09:30,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:30,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:09:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-08-05 11:09:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:09:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-08-05 11:09:30,877 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 26 [2019-08-05 11:09:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:30,877 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-08-05 11:09:30,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:09:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-08-05 11:09:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:09:30,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:30,879 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:30,879 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:30,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:30,880 INFO L82 PathProgramCache]: Analyzing trace with hash -540776470, now seen corresponding path program 5 times [2019-08-05 11:09:30,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:30,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:09:30,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:09:31,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:31,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:09:31,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:09:31,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:09:31,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:31,024 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 9 states. [2019-08-05 11:09:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:31,141 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2019-08-05 11:09:31,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:09:31,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 11:09:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:31,143 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:09:31,143 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:09:31,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:31,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:09:31,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-08-05 11:09:31,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:09:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-08-05 11:09:31,150 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 26 [2019-08-05 11:09:31,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:31,150 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-08-05 11:09:31,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:09:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-08-05 11:09:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:09:31,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:31,152 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:31,152 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:31,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:31,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1629489196, now seen corresponding path program 6 times [2019-08-05 11:09:31,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:31,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:09:31,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:09:31,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:31,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:09:31,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:09:31,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:09:31,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:31,292 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 9 states. [2019-08-05 11:09:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:31,374 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2019-08-05 11:09:31,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:09:31,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 11:09:31,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:31,379 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:09:31,380 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:09:31,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:09:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-08-05 11:09:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:09:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2019-08-05 11:09:31,387 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 26 [2019-08-05 11:09:31,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:31,387 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-08-05 11:09:31,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:09:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2019-08-05 11:09:31,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:09:31,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:31,389 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:31,389 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:31,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:31,390 INFO L82 PathProgramCache]: Analyzing trace with hash -250797718, now seen corresponding path program 7 times [2019-08-05 11:09:31,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:31,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:09:31,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:09:31,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:31,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:09:31,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:09:31,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:09:31,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:31,522 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 9 states. [2019-08-05 11:09:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:31,618 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2019-08-05 11:09:31,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:09:31,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 11:09:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:31,621 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:09:31,621 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:09:31,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:09:31,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2019-08-05 11:09:31,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:09:31,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-08-05 11:09:31,628 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 26 [2019-08-05 11:09:31,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:31,628 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-08-05 11:09:31,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:09:31,628 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-08-05 11:09:31,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:09:31,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:31,631 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:31,631 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:31,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:31,632 INFO L82 PathProgramCache]: Analyzing trace with hash 712227306, now seen corresponding path program 8 times [2019-08-05 11:09:31,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:31,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:09:31,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:09:31,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:31,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:09:31,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:09:31,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:09:31,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:31,710 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 9 states. [2019-08-05 11:09:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:31,934 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2019-08-05 11:09:31,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:09:31,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 11:09:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:31,936 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:09:31,936 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:09:31,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:31,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:09:31,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2019-08-05 11:09:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:09:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2019-08-05 11:09:31,949 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 26 [2019-08-05 11:09:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:31,949 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-08-05 11:09:31,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:09:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2019-08-05 11:09:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:09:31,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:31,951 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:31,952 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:31,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:31,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1168059608, now seen corresponding path program 3 times [2019-08-05 11:09:31,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:31,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:09:31,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-05 11:09:32,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:32,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:09:32,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:09:32,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:09:32,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:32,064 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 9 states. [2019-08-05 11:09:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:32,273 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2019-08-05 11:09:32,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:09:32,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 11:09:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:32,274 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:09:32,274 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:09:32,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:09:32,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-08-05 11:09:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:09:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-08-05 11:09:32,280 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2019-08-05 11:09:32,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:32,280 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-08-05 11:09:32,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:09:32,280 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-08-05 11:09:32,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:32,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:32,281 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:09:32,282 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:32,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:32,282 INFO L82 PathProgramCache]: Analyzing trace with hash 617521474, now seen corresponding path program 4 times [2019-08-05 11:09:32,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:32,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:32,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-08-05 11:09:32,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:32,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:32,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:32,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:32,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:32,531 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 11 states. [2019-08-05 11:09:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:32,572 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2019-08-05 11:09:32,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:32,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:32,574 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:09:32,575 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:09:32,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:09:32,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-08-05 11:09:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:09:32,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-08-05 11:09:32,581 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 33 [2019-08-05 11:09:32,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:32,581 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-08-05 11:09:32,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:32,581 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-08-05 11:09:32,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:32,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:32,582 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:32,583 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:32,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:32,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1400918528, now seen corresponding path program 9 times [2019-08-05 11:09:32,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:32,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:32,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:09:32,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:32,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:32,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:32,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:32,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:32,748 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 11 states. [2019-08-05 11:09:32,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:32,844 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-08-05 11:09:32,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:32,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:32,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:32,851 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:09:32,851 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:09:32,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:32,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:09:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-08-05 11:09:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:09:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2019-08-05 11:09:32,857 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 33 [2019-08-05 11:09:32,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:32,858 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-08-05 11:09:32,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2019-08-05 11:09:32,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:32,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:32,859 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:32,859 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:32,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:32,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1508961152, now seen corresponding path program 10 times [2019-08-05 11:09:32,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:32,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:32,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:09:32,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:32,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:32,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:32,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:32,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:32,978 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 11 states. [2019-08-05 11:09:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:33,039 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2019-08-05 11:09:33,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:33,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:33,041 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:09:33,041 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:09:33,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:09:33,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-08-05 11:09:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:09:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-08-05 11:09:33,046 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 33 [2019-08-05 11:09:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:33,047 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-08-05 11:09:33,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-08-05 11:09:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:33,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:33,048 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:33,049 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:33,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:33,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2002609090, now seen corresponding path program 11 times [2019-08-05 11:09:33,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:33,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:33,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 11:09:33,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:33,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:33,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:33,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:33,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:33,184 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 11 states. [2019-08-05 11:09:33,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:33,275 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2019-08-05 11:09:33,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:33,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:33,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:33,288 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:09:33,288 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:09:33,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:09:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2019-08-05 11:09:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:09:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-08-05 11:09:33,297 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 33 [2019-08-05 11:09:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:33,298 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-08-05 11:09:33,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-08-05 11:09:33,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:33,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:33,299 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:33,299 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:33,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:33,299 INFO L82 PathProgramCache]: Analyzing trace with hash -715701248, now seen corresponding path program 12 times [2019-08-05 11:09:33,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:33,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:33,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:09:33,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:33,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:33,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:33,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:33,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:33,436 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 11 states. [2019-08-05 11:09:33,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:33,505 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2019-08-05 11:09:33,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:33,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:33,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:33,507 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:09:33,508 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:09:33,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:33,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:09:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2019-08-05 11:09:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:09:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2019-08-05 11:09:33,513 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 33 [2019-08-05 11:09:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:33,514 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-08-05 11:09:33,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2019-08-05 11:09:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:33,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:33,515 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:33,515 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:33,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:33,516 INFO L82 PathProgramCache]: Analyzing trace with hash 67695806, now seen corresponding path program 13 times [2019-08-05 11:09:33,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:33,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:33,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 11:09:33,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:33,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:33,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:33,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:33,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:33,628 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 11 states. [2019-08-05 11:09:33,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:33,677 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2019-08-05 11:09:33,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:33,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:33,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:33,679 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:09:33,679 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:09:33,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:09:33,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 41. [2019-08-05 11:09:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:09:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-08-05 11:09:33,683 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 33 [2019-08-05 11:09:33,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:33,684 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-08-05 11:09:33,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2019-08-05 11:09:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:33,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:33,685 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:33,685 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:33,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:33,685 INFO L82 PathProgramCache]: Analyzing trace with hash 175738430, now seen corresponding path program 14 times [2019-08-05 11:09:33,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:33,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:33,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 11:09:33,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:33,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:33,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:33,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:33,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:33,815 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 11 states. [2019-08-05 11:09:33,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:33,864 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2019-08-05 11:09:33,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:33,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:33,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:33,868 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:09:33,869 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:09:33,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:09:33,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2019-08-05 11:09:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:09:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2019-08-05 11:09:33,874 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 33 [2019-08-05 11:09:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:33,874 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-08-05 11:09:33,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2019-08-05 11:09:33,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:33,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:33,875 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:33,876 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:33,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash 959135484, now seen corresponding path program 15 times [2019-08-05 11:09:33,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:33,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:33,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:09:34,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:34,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:34,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:34,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:34,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:34,012 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 11 states. [2019-08-05 11:09:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:34,174 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2019-08-05 11:09:34,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:34,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:34,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:34,175 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:09:34,175 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:09:34,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:09:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-08-05 11:09:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:09:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-08-05 11:09:34,179 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 33 [2019-08-05 11:09:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:34,180 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-08-05 11:09:34,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-08-05 11:09:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:34,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:34,181 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:34,181 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:34,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:34,181 INFO L82 PathProgramCache]: Analyzing trace with hash 950484352, now seen corresponding path program 16 times [2019-08-05 11:09:34,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:34,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:34,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:09:34,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:34,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:34,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:34,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:34,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:34,597 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 11 states. [2019-08-05 11:09:34,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:34,644 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2019-08-05 11:09:34,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:34,644 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:34,646 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:09:34,646 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:09:34,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:09:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2019-08-05 11:09:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:09:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2019-08-05 11:09:34,651 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 33 [2019-08-05 11:09:34,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:34,651 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-08-05 11:09:34,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2019-08-05 11:09:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:34,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:34,652 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:34,653 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:34,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:34,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1733881406, now seen corresponding path program 17 times [2019-08-05 11:09:34,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:34,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:34,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 11:09:34,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:34,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:34,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:34,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:34,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:34,799 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand 11 states. [2019-08-05 11:09:34,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:34,853 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2019-08-05 11:09:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:34,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:34,859 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:09:34,860 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:09:34,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:09:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2019-08-05 11:09:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:09:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2019-08-05 11:09:34,865 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 33 [2019-08-05 11:09:34,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:34,865 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-08-05 11:09:34,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2019-08-05 11:09:34,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:34,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:34,866 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:34,866 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:34,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:34,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1841924030, now seen corresponding path program 18 times [2019-08-05 11:09:34,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:34,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:34,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 11:09:34,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:34,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:34,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:34,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:34,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:34,976 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 11 states. [2019-08-05 11:09:35,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:35,054 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-08-05 11:09:35,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:35,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:35,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:35,056 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:09:35,056 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:09:35,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:35,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:09:35,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2019-08-05 11:09:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:09:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2019-08-05 11:09:35,061 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 33 [2019-08-05 11:09:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:35,062 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-08-05 11:09:35,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2019-08-05 11:09:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:35,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:35,063 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:35,063 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:35,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:35,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1669646212, now seen corresponding path program 19 times [2019-08-05 11:09:35,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:35,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:35,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:09:35,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:35,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:35,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:35,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:35,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:35,169 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand 11 states. [2019-08-05 11:09:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:35,210 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-08-05 11:09:35,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:35,210 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:35,211 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:09:35,211 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:09:35,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:35,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:09:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 41. [2019-08-05 11:09:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:09:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-08-05 11:09:35,215 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 33 [2019-08-05 11:09:35,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:35,216 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-08-05 11:09:35,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2019-08-05 11:09:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:35,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:35,217 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:35,217 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:35,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:35,217 INFO L82 PathProgramCache]: Analyzing trace with hash -382738370, now seen corresponding path program 20 times [2019-08-05 11:09:35,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:35,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:35,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 11:09:35,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:35,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:35,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:35,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:35,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:35,359 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 11 states. [2019-08-05 11:09:35,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:35,448 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2019-08-05 11:09:35,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:35,449 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:35,450 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:09:35,450 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:09:35,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:09:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2019-08-05 11:09:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:09:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2019-08-05 11:09:35,454 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 33 [2019-08-05 11:09:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:35,454 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-08-05 11:09:35,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2019-08-05 11:09:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:35,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:35,456 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:35,456 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:35,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash 400658684, now seen corresponding path program 21 times [2019-08-05 11:09:35,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:35,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:35,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:09:35,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:35,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:35,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:35,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:35,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:35,569 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand 11 states. [2019-08-05 11:09:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:35,634 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-08-05 11:09:35,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:35,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:35,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:35,636 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:09:35,636 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:09:35,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:35,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:09:35,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-08-05 11:09:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:09:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2019-08-05 11:09:35,641 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 33 [2019-08-05 11:09:35,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:35,641 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-08-05 11:09:35,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2019-08-05 11:09:35,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:35,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:35,642 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:35,643 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:35,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:35,643 INFO L82 PathProgramCache]: Analyzing trace with hash 508701308, now seen corresponding path program 22 times [2019-08-05 11:09:35,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:35,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:35,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:35,804 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:09:35,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:35,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:35,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:35,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:35,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:35,806 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 11 states. [2019-08-05 11:09:35,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:35,863 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2019-08-05 11:09:35,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:35,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:35,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:35,864 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:09:35,864 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:09:35,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:09:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2019-08-05 11:09:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:09:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2019-08-05 11:09:35,868 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 33 [2019-08-05 11:09:35,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:35,868 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-08-05 11:09:35,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2019-08-05 11:09:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:35,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:35,869 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:09:35,870 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:35,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:35,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1292098362, now seen corresponding path program 4 times [2019-08-05 11:09:35,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:35,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:35,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-08-05 11:09:36,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:36,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:36,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:36,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:36,056 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand 11 states. [2019-08-05 11:09:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:36,103 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2019-08-05 11:09:36,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:36,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:09:36,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:36,106 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:09:36,106 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:09:36,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:36,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:09:36,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-08-05 11:09:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:09:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-08-05 11:09:36,108 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 33 [2019-08-05 11:09:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:36,109 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-08-05 11:09:36,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-08-05 11:09:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:36,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:36,109 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:09:36,109 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:36,110 INFO L82 PathProgramCache]: Analyzing trace with hash -613197164, now seen corresponding path program 5 times [2019-08-05 11:09:36,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:36,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:36,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 11:09:36,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:36,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:36,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:36,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:36,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:36,237 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 13 states. [2019-08-05 11:09:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:36,283 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-08-05 11:09:36,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:36,286 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:36,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:36,287 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:09:36,287 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:09:36,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:36,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:09:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-08-05 11:09:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:09:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2019-08-05 11:09:36,292 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 40 [2019-08-05 11:09:36,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:36,292 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-08-05 11:09:36,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2019-08-05 11:09:36,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:36,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:36,293 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:36,293 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:36,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:36,293 INFO L82 PathProgramCache]: Analyzing trace with hash -923860014, now seen corresponding path program 23 times [2019-08-05 11:09:36,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:36,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:36,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:09:36,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:36,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:36,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:36,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:36,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:36,526 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 13 states. [2019-08-05 11:09:36,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:36,583 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2019-08-05 11:09:36,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:36,584 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:36,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:36,585 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:09:36,585 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:09:36,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:36,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:09:36,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2019-08-05 11:09:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:09:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2019-08-05 11:09:36,589 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 40 [2019-08-05 11:09:36,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:36,590 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-08-05 11:09:36,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2019-08-05 11:09:36,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:36,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:36,591 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:36,591 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:36,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:36,591 INFO L82 PathProgramCache]: Analyzing trace with hash -34458484, now seen corresponding path program 24 times [2019-08-05 11:09:36,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:36,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:36,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:09:36,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:36,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:36,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:36,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:36,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:36,746 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand 13 states. [2019-08-05 11:09:36,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:36,813 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2019-08-05 11:09:36,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:36,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:36,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:36,825 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:09:36,825 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:09:36,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:09:36,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2019-08-05 11:09:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:09:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-08-05 11:09:36,829 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 40 [2019-08-05 11:09:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:36,830 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-08-05 11:09:36,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-08-05 11:09:36,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:36,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:36,831 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:36,831 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:36,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:36,831 INFO L82 PathProgramCache]: Analyzing trace with hash 71466066, now seen corresponding path program 25 times [2019-08-05 11:09:36,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:36,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:36,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:09:37,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:37,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:37,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:37,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:37,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:37,563 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 13 states. [2019-08-05 11:09:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:37,630 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2019-08-05 11:09:37,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:37,630 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:37,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:37,631 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:09:37,632 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:09:37,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:09:37,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2019-08-05 11:09:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:09:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2019-08-05 11:09:37,637 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 40 [2019-08-05 11:09:37,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:37,637 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2019-08-05 11:09:37,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2019-08-05 11:09:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:37,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:37,639 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:37,639 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:37,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:37,640 INFO L82 PathProgramCache]: Analyzing trace with hash 276204366, now seen corresponding path program 26 times [2019-08-05 11:09:37,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:37,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:37,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:38,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:38,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:38,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:38,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:38,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:38,109 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 13 states. [2019-08-05 11:09:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:38,157 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2019-08-05 11:09:38,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:38,157 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:38,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:38,158 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:09:38,159 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:09:38,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:38,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:09:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-08-05 11:09:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:09:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-08-05 11:09:38,163 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 40 [2019-08-05 11:09:38,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:38,163 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-08-05 11:09:38,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-08-05 11:09:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:38,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:38,164 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:38,164 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:38,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:38,165 INFO L82 PathProgramCache]: Analyzing trace with hash -239196784, now seen corresponding path program 27 times [2019-08-05 11:09:38,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:38,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:38,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:38,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:38,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:38,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:38,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:38,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:38,261 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 13 states. [2019-08-05 11:09:38,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:38,306 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2019-08-05 11:09:38,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:38,307 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:38,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:38,308 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:09:38,308 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:09:38,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:38,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:09:38,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2019-08-05 11:09:38,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:09:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2019-08-05 11:09:38,312 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 40 [2019-08-05 11:09:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:38,312 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-08-05 11:09:38,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2019-08-05 11:09:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:38,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:38,313 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:38,314 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:38,314 INFO L82 PathProgramCache]: Analyzing trace with hash -976595502, now seen corresponding path program 28 times [2019-08-05 11:09:38,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:38,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:38,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:09:38,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:38,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:38,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:38,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:38,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:38,487 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 13 states. [2019-08-05 11:09:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:38,549 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2019-08-05 11:09:38,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:38,549 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:38,550 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:09:38,550 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:09:38,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:38,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:09:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2019-08-05 11:09:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:09:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-08-05 11:09:38,555 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 40 [2019-08-05 11:09:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:38,556 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-08-05 11:09:38,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-08-05 11:09:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:38,557 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:38,557 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:38,557 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:38,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:38,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1287258352, now seen corresponding path program 29 times [2019-08-05 11:09:38,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:38,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:38,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:38,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:38,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:38,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:38,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:38,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:38,760 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 13 states. [2019-08-05 11:09:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:38,808 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2019-08-05 11:09:38,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:38,808 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:38,809 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:09:38,809 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:09:38,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:09:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2019-08-05 11:09:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:09:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2019-08-05 11:09:38,814 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 40 [2019-08-05 11:09:38,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:38,815 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2019-08-05 11:09:38,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2019-08-05 11:09:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:38,816 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:38,816 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:38,816 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:38,817 INFO L82 PathProgramCache]: Analyzing trace with hash -291932272, now seen corresponding path program 30 times [2019-08-05 11:09:38,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:38,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:38,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:39,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:39,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:39,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:39,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:39,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:39,189 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand 13 states. [2019-08-05 11:09:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:39,247 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2019-08-05 11:09:39,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:39,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:39,249 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:09:39,249 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:09:39,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:09:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2019-08-05 11:09:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:09:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-08-05 11:09:39,262 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 40 [2019-08-05 11:09:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:39,263 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-08-05 11:09:39,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-08-05 11:09:39,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:39,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:39,264 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:39,264 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:39,264 INFO L82 PathProgramCache]: Analyzing trace with hash -602595122, now seen corresponding path program 31 times [2019-08-05 11:09:39,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:39,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:39,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:39,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:39,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:39,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:39,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:39,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:39,655 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 13 states. [2019-08-05 11:09:39,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:39,717 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2019-08-05 11:09:39,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:39,717 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:39,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:39,718 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:09:39,718 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:09:39,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:09:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-08-05 11:09:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:09:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2019-08-05 11:09:39,721 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 40 [2019-08-05 11:09:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:39,721 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-08-05 11:09:39,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2019-08-05 11:09:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:39,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:39,722 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:39,722 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:39,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:39,722 INFO L82 PathProgramCache]: Analyzing trace with hash -719121714, now seen corresponding path program 32 times [2019-08-05 11:09:39,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:39,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:39,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:39,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:39,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:39,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:39,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:39,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:39,945 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand 13 states. [2019-08-05 11:09:39,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:39,988 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2019-08-05 11:09:39,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:39,989 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:39,990 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:09:39,990 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:09:39,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:39,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:09:39,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 55. [2019-08-05 11:09:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:09:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2019-08-05 11:09:39,994 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 40 [2019-08-05 11:09:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:39,994 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-08-05 11:09:39,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2019-08-05 11:09:39,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:39,995 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:39,995 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:39,995 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:39,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:39,995 INFO L82 PathProgramCache]: Analyzing trace with hash -45060526, now seen corresponding path program 33 times [2019-08-05 11:09:39,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:40,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:40,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:09:40,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:40,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:40,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:40,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:40,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:40,162 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 13 states. [2019-08-05 11:09:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:40,218 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2019-08-05 11:09:40,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:40,218 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:40,220 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:09:40,220 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:09:40,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:40,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:09:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 63. [2019-08-05 11:09:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:09:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-08-05 11:09:40,225 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 40 [2019-08-05 11:09:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:40,225 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-08-05 11:09:40,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-08-05 11:09:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:40,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:40,226 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:40,226 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:40,227 INFO L82 PathProgramCache]: Analyzing trace with hash -355723376, now seen corresponding path program 34 times [2019-08-05 11:09:40,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:40,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:40,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:40,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:40,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:40,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:40,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:40,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:40,441 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 13 states. [2019-08-05 11:09:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:40,485 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2019-08-05 11:09:40,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:40,486 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:40,487 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:09:40,487 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:09:40,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:09:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2019-08-05 11:09:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:09:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-08-05 11:09:40,490 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 40 [2019-08-05 11:09:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:40,491 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-08-05 11:09:40,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-08-05 11:09:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:40,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:40,492 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:40,492 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:40,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:40,492 INFO L82 PathProgramCache]: Analyzing trace with hash -408458864, now seen corresponding path program 35 times [2019-08-05 11:09:40,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:40,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:40,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:40,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:40,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:40,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:40,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:40,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:40,596 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 13 states. [2019-08-05 11:09:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:40,641 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2019-08-05 11:09:40,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:40,641 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:40,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:40,643 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:09:40,643 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:09:40,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:09:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2019-08-05 11:09:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:09:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2019-08-05 11:09:40,648 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 40 [2019-08-05 11:09:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:40,648 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-08-05 11:09:40,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2019-08-05 11:09:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:40,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:40,649 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:40,650 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:40,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:40,650 INFO L82 PathProgramCache]: Analyzing trace with hash 639602704, now seen corresponding path program 36 times [2019-08-05 11:09:40,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:40,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:40,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:40,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:40,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:40,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:40,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:40,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:40,748 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand 13 states. [2019-08-05 11:09:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:40,788 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2019-08-05 11:09:40,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:40,789 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:40,790 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:09:40,790 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:09:40,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:40,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:09:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2019-08-05 11:09:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:09:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2019-08-05 11:09:40,794 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 40 [2019-08-05 11:09:40,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:40,794 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-08-05 11:09:40,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2019-08-05 11:09:40,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:40,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:40,795 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:40,795 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:40,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:40,796 INFO L82 PathProgramCache]: Analyzing trace with hash 328939854, now seen corresponding path program 37 times [2019-08-05 11:09:40,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:40,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:40,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:40,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:40,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:40,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:40,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:40,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:40,920 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 13 states. [2019-08-05 11:09:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:41,003 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2019-08-05 11:09:41,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:41,004 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:41,004 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:09:41,004 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:09:41,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:41,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:09:41,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 43. [2019-08-05 11:09:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:09:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-08-05 11:09:41,008 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 40 [2019-08-05 11:09:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:41,008 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-08-05 11:09:41,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-08-05 11:09:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:41,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:41,009 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:41,010 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:41,010 INFO L82 PathProgramCache]: Analyzing trace with hash -586700846, now seen corresponding path program 38 times [2019-08-05 11:09:41,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:41,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:41,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:09:41,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:41,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:41,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:41,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:41,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:41,900 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 13 states. [2019-08-05 11:09:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:41,948 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2019-08-05 11:09:41,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:41,949 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:41,950 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:09:41,950 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:09:41,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:09:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2019-08-05 11:09:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:09:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-08-05 11:09:41,954 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 40 [2019-08-05 11:09:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:41,955 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-08-05 11:09:41,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-08-05 11:09:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:41,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:41,956 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:41,956 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:41,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:41,956 INFO L82 PathProgramCache]: Analyzing trace with hash -897363696, now seen corresponding path program 39 times [2019-08-05 11:09:41,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:41,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:41,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:42,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:42,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:42,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:42,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:42,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:42,057 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 13 states. [2019-08-05 11:09:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:42,105 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2019-08-05 11:09:42,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:42,105 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:42,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:42,106 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:09:42,107 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:09:42,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:09:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2019-08-05 11:09:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:09:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2019-08-05 11:09:42,111 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 40 [2019-08-05 11:09:42,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:42,112 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-08-05 11:09:42,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2019-08-05 11:09:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:42,112 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:42,113 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:42,113 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:42,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:42,113 INFO L82 PathProgramCache]: Analyzing trace with hash 97962384, now seen corresponding path program 40 times [2019-08-05 11:09:42,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:42,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:42,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:42,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:42,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:42,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:42,213 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 13 states. [2019-08-05 11:09:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:42,254 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2019-08-05 11:09:42,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:42,255 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:42,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:42,256 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:09:42,256 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:09:42,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:42,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:09:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 59. [2019-08-05 11:09:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:09:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-08-05 11:09:42,261 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 40 [2019-08-05 11:09:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:42,261 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-08-05 11:09:42,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-08-05 11:09:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:42,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:42,262 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:09:42,262 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:42,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:42,262 INFO L82 PathProgramCache]: Analyzing trace with hash -7962166, now seen corresponding path program 5 times [2019-08-05 11:09:42,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 11:09:42,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:42,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:42,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:42,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:42,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:42,337 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 13 states. [2019-08-05 11:09:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:42,376 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-08-05 11:09:42,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:42,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:42,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:42,378 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:09:42,378 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:09:42,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:09:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-08-05 11:09:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:09:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2019-08-05 11:09:42,383 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 40 [2019-08-05 11:09:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:42,383 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-08-05 11:09:42,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2019-08-05 11:09:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:42,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:42,384 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:42,385 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:42,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:42,385 INFO L82 PathProgramCache]: Analyzing trace with hash -212700466, now seen corresponding path program 41 times [2019-08-05 11:09:42,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:42,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:42,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:42,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:42,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:42,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:42,603 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 13 states. [2019-08-05 11:09:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:42,648 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2019-08-05 11:09:42,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:42,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:42,650 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:09:42,650 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:09:42,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:09:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 63. [2019-08-05 11:09:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:09:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-08-05 11:09:42,654 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 40 [2019-08-05 11:09:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:42,654 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-08-05 11:09:42,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-08-05 11:09:42,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:42,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:42,655 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:42,656 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:42,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:42,656 INFO L82 PathProgramCache]: Analyzing trace with hash -950099184, now seen corresponding path program 42 times [2019-08-05 11:09:42,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:42,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:42,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:42,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:42,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:42,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:42,760 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 13 states. [2019-08-05 11:09:42,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:42,905 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2019-08-05 11:09:42,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:42,906 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:42,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:42,906 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:09:42,906 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:09:42,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:42,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:09:42,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 71. [2019-08-05 11:09:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:09:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2019-08-05 11:09:42,913 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 40 [2019-08-05 11:09:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:42,913 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-08-05 11:09:42,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:42,914 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2019-08-05 11:09:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:42,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:42,915 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:42,915 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:42,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:42,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1260762034, now seen corresponding path program 43 times [2019-08-05 11:09:42,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:44,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:44,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:44,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:44,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:44,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:44,108 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 13 states. [2019-08-05 11:09:44,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:44,188 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2019-08-05 11:09:44,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:44,188 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:44,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:44,189 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:09:44,189 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:09:44,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:44,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:09:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2019-08-05 11:09:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:09:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-08-05 11:09:44,194 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 40 [2019-08-05 11:09:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:44,194 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-08-05 11:09:44,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-08-05 11:09:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:44,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:44,195 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:44,195 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:44,196 INFO L82 PathProgramCache]: Analyzing trace with hash -265435954, now seen corresponding path program 44 times [2019-08-05 11:09:44,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:44,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:44,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:44,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:44,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:44,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:44,310 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 13 states. [2019-08-05 11:09:44,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:44,373 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2019-08-05 11:09:44,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:44,373 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:44,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:44,374 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:09:44,374 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:09:44,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:09:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2019-08-05 11:09:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:09:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2019-08-05 11:09:44,378 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 40 [2019-08-05 11:09:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:44,378 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-08-05 11:09:44,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2019-08-05 11:09:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:44,379 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:44,379 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:44,379 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:44,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:44,379 INFO L82 PathProgramCache]: Analyzing trace with hash -576098804, now seen corresponding path program 45 times [2019-08-05 11:09:44,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:09:44,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:44,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:44,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:44,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:44,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:44,446 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 13 states. [2019-08-05 11:09:44,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:44,501 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2019-08-05 11:09:44,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:44,501 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:44,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:44,503 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:09:44,503 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:09:44,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:09:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2019-08-05 11:09:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:09:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-08-05 11:09:44,506 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 40 [2019-08-05 11:09:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:44,507 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-08-05 11:09:44,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-08-05 11:09:44,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:44,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:44,508 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:44,508 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:44,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:44,508 INFO L82 PathProgramCache]: Analyzing trace with hash -18564208, now seen corresponding path program 46 times [2019-08-05 11:09:44,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:44,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:44,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:44,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:44,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:44,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:44,618 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 13 states. [2019-08-05 11:09:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:44,667 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-08-05 11:09:44,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:44,668 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:44,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:44,669 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:09:44,669 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:09:44,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:09:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2019-08-05 11:09:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:09:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-08-05 11:09:44,674 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 40 [2019-08-05 11:09:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:44,674 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-08-05 11:09:44,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-08-05 11:09:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:44,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:44,675 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:44,676 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:44,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:44,676 INFO L82 PathProgramCache]: Analyzing trace with hash -329227058, now seen corresponding path program 47 times [2019-08-05 11:09:44,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:44,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:44,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:44,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:44,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:44,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:44,796 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 13 states. [2019-08-05 11:09:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:44,869 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2019-08-05 11:09:44,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:44,870 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:44,871 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:09:44,871 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:09:44,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:09:44,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2019-08-05 11:09:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:09:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-08-05 11:09:44,875 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 40 [2019-08-05 11:09:44,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:44,875 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-08-05 11:09:44,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:44,875 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-08-05 11:09:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:44,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:44,876 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:44,876 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:44,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:44,876 INFO L82 PathProgramCache]: Analyzing trace with hash 666099022, now seen corresponding path program 48 times [2019-08-05 11:09:44,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:45,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:45,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:45,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:45,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:45,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:45,236 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 13 states. [2019-08-05 11:09:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:45,353 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2019-08-05 11:09:45,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:45,353 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:45,354 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:09:45,355 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:09:45,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:09:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 67. [2019-08-05 11:09:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:09:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-08-05 11:09:45,358 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 40 [2019-08-05 11:09:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:45,358 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-08-05 11:09:45,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-08-05 11:09:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:45,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:45,359 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:45,359 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:45,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash 355436172, now seen corresponding path program 49 times [2019-08-05 11:09:45,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:45,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:45,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:09:45,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:45,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:45,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:45,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:45,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:45,437 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 13 states. [2019-08-05 11:09:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:45,477 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-08-05 11:09:45,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:45,478 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:45,479 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:09:45,479 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:09:45,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:09:45,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-08-05 11:09:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:09:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-08-05 11:09:45,483 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 40 [2019-08-05 11:09:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:45,483 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-08-05 11:09:45,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-08-05 11:09:45,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:45,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:45,484 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:45,484 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:45,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:45,485 INFO L82 PathProgramCache]: Analyzing trace with hash -381962546, now seen corresponding path program 50 times [2019-08-05 11:09:45,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:45,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:45,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:09:45,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:45,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:45,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:45,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:45,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:45,586 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 13 states. [2019-08-05 11:09:45,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:45,627 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2019-08-05 11:09:45,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:45,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:45,629 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:09:45,629 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:09:45,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:09:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2019-08-05 11:09:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:09:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-08-05 11:09:45,633 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 40 [2019-08-05 11:09:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:45,634 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-08-05 11:09:45,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-08-05 11:09:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:45,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:45,635 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:45,635 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:45,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:45,635 INFO L82 PathProgramCache]: Analyzing trace with hash -692625396, now seen corresponding path program 51 times [2019-08-05 11:09:45,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:45,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:45,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:09:45,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:45,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:45,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:45,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:45,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:45,750 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 13 states. [2019-08-05 11:09:45,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:45,791 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2019-08-05 11:09:45,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:45,792 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:45,793 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:09:45,793 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:09:45,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:09:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2019-08-05 11:09:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:09:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-08-05 11:09:45,798 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 40 [2019-08-05 11:09:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:45,799 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-08-05 11:09:45,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-08-05 11:09:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:45,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:45,800 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:45,800 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:45,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:45,800 INFO L82 PathProgramCache]: Analyzing trace with hash 302700684, now seen corresponding path program 52 times [2019-08-05 11:09:45,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:45,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:45,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:09:46,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:46,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:46,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:46,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:46,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:46,002 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 13 states. [2019-08-05 11:09:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:46,056 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-08-05 11:09:46,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:46,056 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-08-05 11:09:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:46,057 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:09:46,057 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:09:46,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:46,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:09:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 45. [2019-08-05 11:09:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:09:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-08-05 11:09:46,061 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 40 [2019-08-05 11:09:46,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:46,061 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-08-05 11:09:46,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2019-08-05 11:09:46,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:46,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:46,062 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:09:46,062 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:46,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:46,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1169432024, now seen corresponding path program 6 times [2019-08-05 11:09:46,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:46,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:46,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-08-05 11:09:46,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:46,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:46,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:46,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:46,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:46,355 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 15 states. [2019-08-05 11:09:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:46,554 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2019-08-05 11:09:46,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:46,554 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:46,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:46,555 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:09:46,555 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:09:46,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:09:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-08-05 11:09:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:09:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-08-05 11:09:46,559 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 47 [2019-08-05 11:09:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:46,559 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-08-05 11:09:46,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-08-05 11:09:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:46,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:46,560 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:46,560 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:46,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:46,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2028798694, now seen corresponding path program 53 times [2019-08-05 11:09:46,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:46,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:46,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:09:46,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:46,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:46,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:46,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:46,745 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 15 states. [2019-08-05 11:09:46,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:46,803 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2019-08-05 11:09:46,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:46,804 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:46,805 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:09:46,805 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:09:46,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:09:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 59. [2019-08-05 11:09:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:09:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-08-05 11:09:46,808 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 47 [2019-08-05 11:09:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:46,808 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-08-05 11:09:46,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-08-05 11:09:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:46,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:46,809 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:46,809 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:46,810 INFO L82 PathProgramCache]: Analyzing trace with hash 738074846, now seen corresponding path program 54 times [2019-08-05 11:09:46,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:46,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:46,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:09:46,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:46,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:46,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:46,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:46,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:46,894 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 15 states. [2019-08-05 11:09:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:46,946 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2019-08-05 11:09:46,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:46,946 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:46,947 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:09:46,947 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:09:46,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:09:46,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2019-08-05 11:09:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:09:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2019-08-05 11:09:46,952 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 47 [2019-08-05 11:09:46,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:46,952 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-08-05 11:09:46,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2019-08-05 11:09:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:46,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:46,953 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:46,953 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:46,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:46,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1834811424, now seen corresponding path program 55 times [2019-08-05 11:09:46,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:46,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:46,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:47,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:47,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:47,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:47,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:47,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:47,069 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 15 states. [2019-08-05 11:09:47,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:47,121 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2019-08-05 11:09:47,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:47,121 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:47,122 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:09:47,122 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:09:47,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:47,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:09:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2019-08-05 11:09:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:09:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2019-08-05 11:09:47,125 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 47 [2019-08-05 11:09:47,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:47,125 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-08-05 11:09:47,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2019-08-05 11:09:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:47,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:47,125 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:47,126 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:47,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:47,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1019954074, now seen corresponding path program 56 times [2019-08-05 11:09:47,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:47,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:47,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:09:47,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:47,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:47,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:47,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:47,239 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 15 states. [2019-08-05 11:09:47,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:47,311 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2019-08-05 11:09:47,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:47,312 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:47,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:47,313 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:09:47,313 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:09:47,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:09:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2019-08-05 11:09:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:09:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2019-08-05 11:09:47,317 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 47 [2019-08-05 11:09:47,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:47,317 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-08-05 11:09:47,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2019-08-05 11:09:47,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:47,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:47,318 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:47,319 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:47,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:47,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2116690652, now seen corresponding path program 57 times [2019-08-05 11:09:47,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:47,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:47,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:47,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:47,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:47,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:47,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:47,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:47,495 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 15 states. [2019-08-05 11:09:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:47,592 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2019-08-05 11:09:47,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:47,592 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:47,593 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:09:47,593 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:09:47,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:47,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:09:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2019-08-05 11:09:47,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:09:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-08-05 11:09:47,597 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 47 [2019-08-05 11:09:47,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:47,598 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-08-05 11:09:47,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-08-05 11:09:47,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:47,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:47,599 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:47,599 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:47,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:47,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1088949018, now seen corresponding path program 58 times [2019-08-05 11:09:47,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:47,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:47,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:09:47,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:47,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:47,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:47,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:47,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:47,966 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 15 states. [2019-08-05 11:09:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:48,083 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2019-08-05 11:09:48,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:48,085 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:48,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:48,086 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:09:48,086 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:09:48,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:09:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2019-08-05 11:09:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:09:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2019-08-05 11:09:48,091 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 47 [2019-08-05 11:09:48,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:48,092 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-08-05 11:09:48,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2019-08-05 11:09:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:48,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:48,093 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:48,093 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:48,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:48,093 INFO L82 PathProgramCache]: Analyzing trace with hash 588596896, now seen corresponding path program 59 times [2019-08-05 11:09:48,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:48,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:48,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:48,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:48,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:48,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:48,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:48,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:48,200 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 15 states. [2019-08-05 11:09:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:48,245 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2019-08-05 11:09:48,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:48,248 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:48,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:48,249 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:09:48,249 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:09:48,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:09:48,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 79. [2019-08-05 11:09:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:09:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2019-08-05 11:09:48,253 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 47 [2019-08-05 11:09:48,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:48,253 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2019-08-05 11:09:48,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:48,253 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2019-08-05 11:09:48,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:48,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:48,254 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:48,254 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:48,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:48,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2109281700, now seen corresponding path program 60 times [2019-08-05 11:09:48,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:48,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:48,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:48,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:48,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:48,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:48,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:48,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:48,350 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 15 states. [2019-08-05 11:09:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:48,398 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2019-08-05 11:09:48,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:48,399 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:48,400 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:09:48,400 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:09:48,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:48,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:09:48,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2019-08-05 11:09:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:09:48,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2019-08-05 11:09:48,404 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 47 [2019-08-05 11:09:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:48,404 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-08-05 11:09:48,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2019-08-05 11:09:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:48,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:48,405 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:48,406 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:48,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:48,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1685333474, now seen corresponding path program 61 times [2019-08-05 11:09:48,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:48,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:48,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:09:48,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:48,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:48,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:48,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:48,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:48,536 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 15 states. [2019-08-05 11:09:48,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:48,589 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2019-08-05 11:09:48,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:48,590 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:48,591 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:09:48,591 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:09:48,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:09:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2019-08-05 11:09:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:09:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-08-05 11:09:48,595 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 47 [2019-08-05 11:09:48,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:48,595 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-08-05 11:09:48,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-08-05 11:09:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:48,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:48,596 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:48,596 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:48,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:48,596 INFO L82 PathProgramCache]: Analyzing trace with hash -939471068, now seen corresponding path program 62 times [2019-08-05 11:09:48,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:48,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:48,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:48,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:48,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:48,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:48,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:48,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:48,670 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 15 states. [2019-08-05 11:09:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:48,740 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2019-08-05 11:09:48,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:48,740 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:48,741 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:09:48,741 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:09:48,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:09:48,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2019-08-05 11:09:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:09:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2019-08-05 11:09:48,745 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 47 [2019-08-05 11:09:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:48,745 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-08-05 11:09:48,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2019-08-05 11:09:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:48,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:48,746 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:48,746 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:48,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:48,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2036207646, now seen corresponding path program 63 times [2019-08-05 11:09:48,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:48,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:48,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:09:49,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:49,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:49,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:49,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:49,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:49,130 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 15 states. [2019-08-05 11:09:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:49,183 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2019-08-05 11:09:49,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:49,183 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:49,184 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:09:49,185 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:09:49,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:09:49,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 59. [2019-08-05 11:09:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:09:49,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-08-05 11:09:49,188 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 47 [2019-08-05 11:09:49,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:49,189 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-08-05 11:09:49,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-08-05 11:09:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:49,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:49,190 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:49,190 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:49,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:49,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1578569318, now seen corresponding path program 64 times [2019-08-05 11:09:49,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:49,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:49,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:09:49,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:49,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:49,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:49,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:49,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:49,326 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 15 states. [2019-08-05 11:09:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:49,370 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2019-08-05 11:09:49,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:49,371 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:49,372 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:09:49,372 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:09:49,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:09:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2019-08-05 11:09:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:09:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2019-08-05 11:09:49,375 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 47 [2019-08-05 11:09:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:49,376 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-08-05 11:09:49,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:49,376 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2019-08-05 11:09:49,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:49,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:49,377 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:49,377 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:49,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:49,377 INFO L82 PathProgramCache]: Analyzing trace with hash 481832740, now seen corresponding path program 65 times [2019-08-05 11:09:49,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:49,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:49,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:50,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:50,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:50,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:50,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:50,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:50,295 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 15 states. [2019-08-05 11:09:50,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:50,346 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2019-08-05 11:09:50,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:50,346 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:50,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:50,348 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:09:50,348 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:09:50,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:50,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:09:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 67. [2019-08-05 11:09:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:09:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-08-05 11:09:50,354 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 47 [2019-08-05 11:09:50,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:50,354 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-08-05 11:09:50,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-08-05 11:09:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:50,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:50,355 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:50,355 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:50,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:50,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1728047268, now seen corresponding path program 66 times [2019-08-05 11:09:50,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:50,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:50,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:50,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:50,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:50,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:50,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:50,471 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 15 states. [2019-08-05 11:09:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:50,516 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2019-08-05 11:09:50,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:50,517 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:50,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:50,518 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:09:50,518 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:09:50,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:50,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:09:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 71. [2019-08-05 11:09:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:09:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2019-08-05 11:09:50,522 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 47 [2019-08-05 11:09:50,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:50,522 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-08-05 11:09:50,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2019-08-05 11:09:50,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:50,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:50,523 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:50,523 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:50,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:50,524 INFO L82 PathProgramCache]: Analyzing trace with hash 631310690, now seen corresponding path program 67 times [2019-08-05 11:09:50,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:50,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:50,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:09:50,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:50,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:50,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:50,774 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 15 states. [2019-08-05 11:09:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:50,821 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2019-08-05 11:09:50,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:50,822 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:50,823 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:09:50,823 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:09:50,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:09:50,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2019-08-05 11:09:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:09:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-08-05 11:09:50,826 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 47 [2019-08-05 11:09:50,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:50,827 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-08-05 11:09:50,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-08-05 11:09:50,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:50,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:50,827 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:50,828 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:50,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:50,828 INFO L82 PathProgramCache]: Analyzing trace with hash 657591840, now seen corresponding path program 68 times [2019-08-05 11:09:50,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:50,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:50,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:51,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:51,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:51,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:51,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:51,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:51,211 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 15 states. [2019-08-05 11:09:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:51,288 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2019-08-05 11:09:51,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:51,288 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:51,289 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:09:51,289 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:09:51,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:09:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2019-08-05 11:09:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:09:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2019-08-05 11:09:51,293 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 47 [2019-08-05 11:09:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:51,293 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-08-05 11:09:51,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2019-08-05 11:09:51,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:51,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:51,294 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:51,294 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:51,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:51,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1659052324, now seen corresponding path program 69 times [2019-08-05 11:09:51,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:51,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:51,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:51,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:51,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:51,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:51,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:51,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:51,606 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 15 states. [2019-08-05 11:09:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:51,680 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2019-08-05 11:09:51,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:51,681 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:51,682 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:09:51,682 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:09:51,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:09:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2019-08-05 11:09:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:09:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2019-08-05 11:09:51,685 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 47 [2019-08-05 11:09:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:51,686 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2019-08-05 11:09:51,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2019-08-05 11:09:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:51,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:51,687 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:51,687 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:51,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:51,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1754328418, now seen corresponding path program 70 times [2019-08-05 11:09:51,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:51,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:51,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:09:51,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:51,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:51,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:51,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:51,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:51,952 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 15 states. [2019-08-05 11:09:52,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:52,006 INFO L93 Difference]: Finished difference Result 113 states and 140 transitions. [2019-08-05 11:09:52,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:52,006 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:52,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:52,007 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:09:52,007 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:09:52,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:09:52,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 75. [2019-08-05 11:09:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:09:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2019-08-05 11:09:52,011 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 47 [2019-08-05 11:09:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:52,011 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-08-05 11:09:52,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2019-08-05 11:09:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:52,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:52,013 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:52,013 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:52,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:52,013 INFO L82 PathProgramCache]: Analyzing trace with hash 562315746, now seen corresponding path program 71 times [2019-08-05 11:09:52,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:52,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:52,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:09:52,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:52,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:52,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:52,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:52,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:52,108 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 15 states. [2019-08-05 11:09:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:52,160 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2019-08-05 11:09:52,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:52,160 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:52,161 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:09:52,161 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:09:52,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:52,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:09:52,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 71. [2019-08-05 11:09:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:09:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2019-08-05 11:09:52,164 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 47 [2019-08-05 11:09:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:52,165 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-08-05 11:09:52,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:52,165 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2019-08-05 11:09:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:52,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:52,165 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:52,165 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:52,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:52,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1808530274, now seen corresponding path program 72 times [2019-08-05 11:09:52,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:52,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:52,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:09:52,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:52,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:52,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:52,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:52,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:52,238 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 15 states. [2019-08-05 11:09:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:52,320 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2019-08-05 11:09:52,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:52,327 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:52,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:52,328 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:09:52,328 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:09:52,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:52,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:09:52,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2019-08-05 11:09:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:09:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2019-08-05 11:09:52,332 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 47 [2019-08-05 11:09:52,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:52,332 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-08-05 11:09:52,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2019-08-05 11:09:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:52,333 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:52,334 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:52,334 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:52,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:52,334 INFO L82 PathProgramCache]: Analyzing trace with hash 711793696, now seen corresponding path program 73 times [2019-08-05 11:09:52,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:52,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:52,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:52,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:52,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:52,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:52,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:52,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:52,930 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 15 states. [2019-08-05 11:09:52,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:52,982 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-08-05 11:09:52,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:52,982 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:52,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:52,983 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:09:52,983 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:09:52,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:09:52,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-08-05 11:09:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:09:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2019-08-05 11:09:52,987 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 47 [2019-08-05 11:09:52,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:52,987 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2019-08-05 11:09:52,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:52,987 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2019-08-05 11:09:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:52,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:52,988 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:52,988 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:52,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1143150874, now seen corresponding path program 74 times [2019-08-05 11:09:52,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:52,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:52,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:09:53,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:53,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:53,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:53,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:53,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:53,151 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 15 states. [2019-08-05 11:09:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:53,198 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2019-08-05 11:09:53,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:53,198 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:53,199 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:09:53,199 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:09:53,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:09:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2019-08-05 11:09:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:09:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:09:53,203 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 47 [2019-08-05 11:09:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:53,204 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:09:53,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:09:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:53,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:53,205 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:53,205 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:53,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:53,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2055079844, now seen corresponding path program 75 times [2019-08-05 11:09:53,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:53,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:53,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:53,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:53,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:53,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:53,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:53,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:53,295 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 15 states. [2019-08-05 11:09:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:53,346 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2019-08-05 11:09:53,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:53,347 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:53,348 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:09:53,348 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:09:53,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:09:53,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 69. [2019-08-05 11:09:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:09:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:09:53,351 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 47 [2019-08-05 11:09:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:53,352 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:09:53,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:09:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:53,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:53,353 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:53,353 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:53,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:53,353 INFO L82 PathProgramCache]: Analyzing trace with hash -993672924, now seen corresponding path program 76 times [2019-08-05 11:09:53,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:53,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:53,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:53,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:53,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:53,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:53,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:53,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:53,777 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 15 states. [2019-08-05 11:09:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:53,831 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2019-08-05 11:09:53,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:53,832 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:53,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:53,833 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:09:53,833 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:09:53,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:53,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:09:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2019-08-05 11:09:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:09:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:09:53,837 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 47 [2019-08-05 11:09:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:53,837 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:09:53,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:09:53,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:53,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:53,838 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:53,838 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:53,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:53,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2090409502, now seen corresponding path program 77 times [2019-08-05 11:09:53,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:53,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:53,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:09:54,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:54,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:54,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:54,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:54,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:54,793 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 15 states. [2019-08-05 11:09:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:54,842 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2019-08-05 11:09:54,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:54,844 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:54,845 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:09:54,845 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:09:54,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:09:54,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 65. [2019-08-05 11:09:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:09:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2019-08-05 11:09:54,849 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 47 [2019-08-05 11:09:54,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:54,850 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2019-08-05 11:09:54,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2019-08-05 11:09:54,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:54,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:54,850 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:54,851 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:54,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:54,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1062667868, now seen corresponding path program 78 times [2019-08-05 11:09:54,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:54,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:54,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:54,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:54,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:54,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:54,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:54,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:54,984 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand 15 states. [2019-08-05 11:09:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:55,029 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2019-08-05 11:09:55,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:55,029 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:55,030 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:09:55,030 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:09:55,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:55,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:09:55,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2019-08-05 11:09:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:09:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:09:55,034 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 47 [2019-08-05 11:09:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:55,034 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:09:55,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:09:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:55,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:55,035 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:55,035 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:55,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:55,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2135562850, now seen corresponding path program 79 times [2019-08-05 11:09:55,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:55,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:55,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:09:55,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:55,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:55,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:55,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:55,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:55,518 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 15 states. [2019-08-05 11:09:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:55,573 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2019-08-05 11:09:55,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:55,573 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:55,574 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:09:55,574 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:09:55,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:09:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2019-08-05 11:09:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:09:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:09:55,578 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 47 [2019-08-05 11:09:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:55,579 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:09:55,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:55,579 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:09:55,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:55,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:55,579 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:55,580 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:55,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:55,580 INFO L82 PathProgramCache]: Analyzing trace with hash -913189918, now seen corresponding path program 80 times [2019-08-05 11:09:55,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:55,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:55,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:09:55,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:55,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:55,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:55,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:55,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:55,730 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 15 states. [2019-08-05 11:09:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:55,784 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2019-08-05 11:09:55,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:55,785 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:55,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:55,786 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:09:55,786 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:09:55,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:09:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 73. [2019-08-05 11:09:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:09:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:09:55,789 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 47 [2019-08-05 11:09:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:55,790 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:09:55,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:09:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:55,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:55,791 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:55,791 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:55,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:55,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2009926496, now seen corresponding path program 81 times [2019-08-05 11:09:55,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:55,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:55,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:55,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:55,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:55,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:55,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:55,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:55,919 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 15 states. [2019-08-05 11:09:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:55,986 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2019-08-05 11:09:55,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:55,986 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:55,987 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:09:55,987 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:09:55,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:09:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 61. [2019-08-05 11:09:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:09:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2019-08-05 11:09:55,991 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 47 [2019-08-05 11:09:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:55,991 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2019-08-05 11:09:55,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:55,991 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2019-08-05 11:09:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:55,992 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:55,992 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:55,992 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:55,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:55,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1604850468, now seen corresponding path program 82 times [2019-08-05 11:09:55,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:55,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:55,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:56,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:56,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:56,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:56,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:56,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:56,151 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 15 states. [2019-08-05 11:09:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:56,219 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2019-08-05 11:09:56,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:56,220 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:56,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:56,221 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:09:56,221 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:09:56,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:09:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. [2019-08-05 11:09:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:09:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2019-08-05 11:09:56,223 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 47 [2019-08-05 11:09:56,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:56,224 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2019-08-05 11:09:56,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2019-08-05 11:09:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:56,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:56,224 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:56,225 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:56,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:56,225 INFO L82 PathProgramCache]: Analyzing trace with hash 508113890, now seen corresponding path program 83 times [2019-08-05 11:09:56,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:56,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:56,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:09:56,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:56,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:56,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:56,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:56,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:56,607 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand 15 states. [2019-08-05 11:09:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:56,656 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2019-08-05 11:09:56,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:56,657 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:56,658 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:09:56,658 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:09:56,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:09:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 49. [2019-08-05 11:09:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:09:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2019-08-05 11:09:56,660 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 47 [2019-08-05 11:09:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:56,660 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2019-08-05 11:09:56,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2019-08-05 11:09:56,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:56,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:56,661 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:56,661 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:56,661 INFO L82 PathProgramCache]: Analyzing trace with hash 307978342, now seen corresponding path program 84 times [2019-08-05 11:09:56,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:56,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:56,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:09:56,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:56,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:56,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:56,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:56,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:56,845 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 15 states. [2019-08-05 11:09:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:56,892 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2019-08-05 11:09:56,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:56,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:56,893 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:09:56,894 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:09:56,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:56,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:09:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2019-08-05 11:09:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:09:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:09:56,896 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 47 [2019-08-05 11:09:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:56,896 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:09:56,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:09:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:56,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:56,897 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:56,897 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:56,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:56,898 INFO L82 PathProgramCache]: Analyzing trace with hash -788758236, now seen corresponding path program 85 times [2019-08-05 11:09:56,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:56,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:56,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:56,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:56,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:56,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:56,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:56,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:56,975 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 15 states. [2019-08-05 11:09:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:57,028 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2019-08-05 11:09:57,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:57,029 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:57,030 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:09:57,030 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:09:57,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:09:57,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 65. [2019-08-05 11:09:57,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:09:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2019-08-05 11:09:57,033 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 47 [2019-08-05 11:09:57,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:57,033 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2019-08-05 11:09:57,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2019-08-05 11:09:57,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:57,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:57,034 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:57,034 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:57,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:57,035 INFO L82 PathProgramCache]: Analyzing trace with hash 457456292, now seen corresponding path program 86 times [2019-08-05 11:09:57,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:57,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:57,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:57,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:57,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:57,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:57,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:57,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:57,205 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand 15 states. [2019-08-05 11:09:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:57,384 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2019-08-05 11:09:57,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:57,384 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:57,385 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:09:57,385 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:09:57,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:09:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 69. [2019-08-05 11:09:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:09:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:09:57,388 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 47 [2019-08-05 11:09:57,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:57,388 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:09:57,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:09:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:57,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:57,389 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:09:57,389 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:57,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:57,389 INFO L82 PathProgramCache]: Analyzing trace with hash -2079482084, now seen corresponding path program 6 times [2019-08-05 11:09:57,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:57,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:57,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-08-05 11:09:57,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:57,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:57,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:57,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:57,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:57,461 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 15 states. [2019-08-05 11:09:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:57,503 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2019-08-05 11:09:57,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:57,504 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:57,505 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:09:57,505 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:09:57,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:09:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2019-08-05 11:09:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:09:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2019-08-05 11:09:57,508 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 47 [2019-08-05 11:09:57,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:57,508 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2019-08-05 11:09:57,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2019-08-05 11:09:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:57,509 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:57,509 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:57,509 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:57,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:57,509 INFO L82 PathProgramCache]: Analyzing trace with hash -982745506, now seen corresponding path program 87 times [2019-08-05 11:09:57,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:57,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:57,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:09:57,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:57,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:57,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:57,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:57,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:57,581 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 15 states. [2019-08-05 11:09:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:57,766 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2019-08-05 11:09:57,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:57,766 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:57,767 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:09:57,767 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:09:57,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:57,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:09:57,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-08-05 11:09:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:09:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2019-08-05 11:09:57,771 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 47 [2019-08-05 11:09:57,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:57,771 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2019-08-05 11:09:57,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2019-08-05 11:09:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:57,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:57,772 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:57,772 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:57,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:57,772 INFO L82 PathProgramCache]: Analyzing trace with hash -639280286, now seen corresponding path program 88 times [2019-08-05 11:09:57,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:57,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:57,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:09:57,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:57,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:57,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:57,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:57,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:57,957 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 15 states. [2019-08-05 11:09:58,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:58,006 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2019-08-05 11:09:58,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:58,007 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:58,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:58,008 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:09:58,008 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:09:58,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:58,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:09:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2019-08-05 11:09:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:09:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:09:58,011 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 47 [2019-08-05 11:09:58,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:58,011 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:09:58,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:09:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:58,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:58,012 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:58,013 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:58,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash 388461348, now seen corresponding path program 89 times [2019-08-05 11:09:58,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:58,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:58,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:58,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:58,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:58,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:58,218 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 15 states. [2019-08-05 11:09:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:58,262 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2019-08-05 11:09:58,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:58,262 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:58,263 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:09:58,263 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:09:58,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:09:58,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2019-08-05 11:09:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:09:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2019-08-05 11:09:58,267 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 47 [2019-08-05 11:09:58,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:58,267 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2019-08-05 11:09:58,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2019-08-05 11:09:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:58,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:58,267 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:58,268 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash -708275230, now seen corresponding path program 90 times [2019-08-05 11:09:58,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:58,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:58,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:09:58,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:58,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:58,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:58,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:58,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:58,442 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 15 states. [2019-08-05 11:09:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:58,498 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2019-08-05 11:09:58,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:58,498 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:58,499 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:09:58,499 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:09:58,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:09:58,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 77. [2019-08-05 11:09:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:09:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2019-08-05 11:09:58,503 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 47 [2019-08-05 11:09:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:58,503 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2019-08-05 11:09:58,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:58,504 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2019-08-05 11:09:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:58,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:58,504 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:58,505 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:58,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:58,505 INFO L82 PathProgramCache]: Analyzing trace with hash 537939298, now seen corresponding path program 91 times [2019-08-05 11:09:58,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:58,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:58,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:09:58,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:58,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:58,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:58,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:58,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:58,721 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 15 states. [2019-08-05 11:09:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:58,794 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2019-08-05 11:09:58,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:58,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:58,796 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:09:58,796 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:09:58,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:58,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:09:58,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2019-08-05 11:09:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:09:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2019-08-05 11:09:58,799 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 47 [2019-08-05 11:09:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:58,800 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2019-08-05 11:09:58,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2019-08-05 11:09:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:58,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:58,801 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:58,801 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash -558797280, now seen corresponding path program 92 times [2019-08-05 11:09:58,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:58,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:58,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:58,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:58,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:58,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:58,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:58,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:58,924 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 15 states. [2019-08-05 11:09:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:58,972 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2019-08-05 11:09:58,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:58,972 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:58,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:58,973 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:09:58,974 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:09:58,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:09:58,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 69. [2019-08-05 11:09:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:09:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:09:58,976 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 47 [2019-08-05 11:09:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:58,976 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:09:58,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:09:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:58,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:58,977 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:58,977 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:58,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:58,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1238987612, now seen corresponding path program 93 times [2019-08-05 11:09:58,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:58,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:58,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:09:59,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:59,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:59,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:59,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:59,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:59,072 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 15 states. [2019-08-05 11:09:59,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:59,116 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2019-08-05 11:09:59,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:59,116 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:59,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:59,117 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:09:59,117 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:09:59,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:09:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2019-08-05 11:09:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:09:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2019-08-05 11:09:59,121 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 47 [2019-08-05 11:09:59,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:59,121 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2019-08-05 11:09:59,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2019-08-05 11:09:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:59,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:59,122 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:59,122 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:59,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:59,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2066007262, now seen corresponding path program 94 times [2019-08-05 11:09:59,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:59,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:59,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:09:59,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:59,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:59,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:59,281 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 15 states. [2019-08-05 11:09:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:59,327 INFO L93 Difference]: Finished difference Result 107 states and 132 transitions. [2019-08-05 11:09:59,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:59,328 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:59,329 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:09:59,329 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:09:59,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:09:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 85. [2019-08-05 11:09:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:09:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2019-08-05 11:09:59,332 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 47 [2019-08-05 11:09:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:59,332 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2019-08-05 11:09:59,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2019-08-05 11:09:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:59,333 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:59,333 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:59,333 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:59,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:59,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1959243106, now seen corresponding path program 95 times [2019-08-05 11:09:59,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:59,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:59,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:09:59,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:59,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:59,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:59,785 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 15 states. [2019-08-05 11:09:59,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:59,845 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:09:59,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:59,846 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:09:59,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:59,847 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:09:59,847 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:09:59,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:09:59,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 81. [2019-08-05 11:09:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:09:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2019-08-05 11:09:59,851 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 47 [2019-08-05 11:09:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:59,851 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2019-08-05 11:09:59,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2019-08-05 11:09:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:59,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:59,852 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:59,852 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:59,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:59,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1089509662, now seen corresponding path program 96 times [2019-08-05 11:09:59,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:59,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:59,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:10:00,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:00,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:00,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:00,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:00,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:00,504 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 15 states. [2019-08-05 11:10:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:00,558 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:00,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:00,558 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:00,559 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:00,559 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:00,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2019-08-05 11:10:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:10:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2019-08-05 11:10:00,562 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 47 [2019-08-05 11:10:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:00,562 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2019-08-05 11:10:00,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2019-08-05 11:10:00,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:00,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:00,563 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:00,563 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:00,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:00,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2108721056, now seen corresponding path program 97 times [2019-08-05 11:10:00,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:00,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:00,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:10:01,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:01,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:01,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:01,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:01,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:01,546 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 15 states. [2019-08-05 11:10:01,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:01,635 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:01,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:01,635 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:01,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:01,635 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:01,635 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:01,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2019-08-05 11:10:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:10:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2019-08-05 11:10:01,638 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 47 [2019-08-05 11:10:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:01,638 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2019-08-05 11:10:01,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2019-08-05 11:10:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:01,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:01,639 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:01,639 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:01,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:01,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1158504606, now seen corresponding path program 98 times [2019-08-05 11:10:01,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:01,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:01,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:10:01,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:01,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:01,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:01,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:01,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:01,796 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 15 states. [2019-08-05 11:10:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:01,867 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:01,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:01,867 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:01,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:01,868 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:01,868 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:01,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:01,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:01,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2019-08-05 11:10:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:10:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2019-08-05 11:10:01,872 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 47 [2019-08-05 11:10:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:01,872 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2019-08-05 11:10:01,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2019-08-05 11:10:01,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:01,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:01,873 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:01,873 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:01,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:01,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2039726112, now seen corresponding path program 99 times [2019-08-05 11:10:01,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:01,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:01,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:10:02,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:02,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:02,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:02,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:02,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:02,086 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 15 states. [2019-08-05 11:10:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:02,147 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:02,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:02,151 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:02,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:02,151 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:02,151 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:02,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:02,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:02,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 81. [2019-08-05 11:10:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:10:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2019-08-05 11:10:02,154 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 47 [2019-08-05 11:10:02,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:02,154 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2019-08-05 11:10:02,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2019-08-05 11:10:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:02,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:02,155 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:02,155 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:02,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:02,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1009026656, now seen corresponding path program 100 times [2019-08-05 11:10:02,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:02,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:02,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:10:02,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:02,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:02,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:02,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:02,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:02,329 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 15 states. [2019-08-05 11:10:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:02,387 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2019-08-05 11:10:02,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:02,388 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:02,388 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:10:02,388 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:10:02,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:10:02,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 85. [2019-08-05 11:10:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:10:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2019-08-05 11:10:02,392 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 47 [2019-08-05 11:10:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:02,392 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2019-08-05 11:10:02,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2019-08-05 11:10:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:02,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:02,396 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:02,396 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:02,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:02,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2105763234, now seen corresponding path program 101 times [2019-08-05 11:10:02,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:02,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:02,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:10:02,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:02,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:02,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:02,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:02,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:02,573 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 15 states. [2019-08-05 11:10:02,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:02,623 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2019-08-05 11:10:02,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:02,623 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:02,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:02,624 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:10:02,624 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:10:02,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:10:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2019-08-05 11:10:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:10:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:10:02,628 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 47 [2019-08-05 11:10:02,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:02,628 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:10:02,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:10:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:02,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:02,629 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:02,629 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:02,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:02,630 INFO L82 PathProgramCache]: Analyzing trace with hash 334259492, now seen corresponding path program 102 times [2019-08-05 11:10:02,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:02,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:02,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:10:02,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:02,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:02,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:02,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:02,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:02,732 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 15 states. [2019-08-05 11:10:02,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:02,777 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2019-08-05 11:10:02,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:02,778 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:02,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:02,779 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:10:02,779 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:10:02,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:10:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 81. [2019-08-05 11:10:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:10:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2019-08-05 11:10:02,782 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 47 [2019-08-05 11:10:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:02,782 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2019-08-05 11:10:02,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:02,782 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2019-08-05 11:10:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:02,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:02,783 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:02,783 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:02,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:02,783 INFO L82 PathProgramCache]: Analyzing trace with hash -762477086, now seen corresponding path program 103 times [2019-08-05 11:10:02,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:02,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:02,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:10:02,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:02,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:02,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:02,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:02,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:02,857 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 15 states. [2019-08-05 11:10:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:02,909 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2019-08-05 11:10:02,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:02,910 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:02,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:02,911 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:10:02,911 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:10:02,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:02,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:10:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2019-08-05 11:10:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:10:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2019-08-05 11:10:02,915 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 47 [2019-08-05 11:10:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:02,915 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2019-08-05 11:10:02,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2019-08-05 11:10:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:02,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:02,916 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:02,916 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:02,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:02,917 INFO L82 PathProgramCache]: Analyzing trace with hash 483737442, now seen corresponding path program 104 times [2019-08-05 11:10:02,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:02,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:02,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:10:03,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:03,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:03,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:03,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:03,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:03,019 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 15 states. [2019-08-05 11:10:03,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:03,071 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:03,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:03,072 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:03,073 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:03,073 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:03,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:03,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 81. [2019-08-05 11:10:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:10:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2019-08-05 11:10:03,076 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 47 [2019-08-05 11:10:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:03,076 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2019-08-05 11:10:03,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2019-08-05 11:10:03,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:03,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:03,077 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:03,077 INFO L418 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:03,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:03,077 INFO L82 PathProgramCache]: Analyzing trace with hash -612999136, now seen corresponding path program 105 times [2019-08-05 11:10:03,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:03,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:03,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:10:03,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:03,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:03,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:03,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:03,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:03,309 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 15 states. [2019-08-05 11:10:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:03,359 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:03,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:03,359 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:03,360 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:03,360 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:03,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:03,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 73. [2019-08-05 11:10:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:03,363 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 47 [2019-08-05 11:10:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:03,363 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:03,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:03,364 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:03,364 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:03,364 INFO L418 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:03,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:03,365 INFO L82 PathProgramCache]: Analyzing trace with hash 414742498, now seen corresponding path program 106 times [2019-08-05 11:10:03,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:03,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:03,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:10:03,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:03,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:03,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:03,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:03,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:03,436 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 15 states. [2019-08-05 11:10:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:03,507 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:03,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:03,507 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:03,508 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:03,508 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:03,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 81. [2019-08-05 11:10:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:10:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2019-08-05 11:10:03,512 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 47 [2019-08-05 11:10:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:03,512 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2019-08-05 11:10:03,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2019-08-05 11:10:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:03,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:03,512 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:03,513 INFO L418 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:03,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:03,513 INFO L82 PathProgramCache]: Analyzing trace with hash -681994080, now seen corresponding path program 107 times [2019-08-05 11:10:03,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:03,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:03,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:10:03,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:03,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:03,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:03,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:03,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:03,617 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 15 states. [2019-08-05 11:10:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:03,820 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:03,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:03,820 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:03,820 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:03,820 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:03,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:03,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:03,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2019-08-05 11:10:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:10:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2019-08-05 11:10:03,826 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 47 [2019-08-05 11:10:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:03,826 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2019-08-05 11:10:03,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2019-08-05 11:10:03,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:03,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:03,827 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:03,827 INFO L418 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:03,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:03,827 INFO L82 PathProgramCache]: Analyzing trace with hash 564220448, now seen corresponding path program 108 times [2019-08-05 11:10:03,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:03,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:03,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:10:03,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:03,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:03,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:03,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:03,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:03,922 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 15 states. [2019-08-05 11:10:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:03,973 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2019-08-05 11:10:03,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:03,973 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:03,974 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:10:03,974 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:10:03,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:10:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 81. [2019-08-05 11:10:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:10:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2019-08-05 11:10:03,978 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 47 [2019-08-05 11:10:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:03,978 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2019-08-05 11:10:03,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2019-08-05 11:10:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:03,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:03,979 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:03,979 INFO L418 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:03,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:03,979 INFO L82 PathProgramCache]: Analyzing trace with hash -532516130, now seen corresponding path program 109 times [2019-08-05 11:10:03,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:03,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:03,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:10:04,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:04,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:04,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:04,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:04,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:04,709 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 15 states. [2019-08-05 11:10:04,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:04,855 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2019-08-05 11:10:04,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:04,856 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:04,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:04,856 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:10:04,857 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:10:04,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:10:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 69. [2019-08-05 11:10:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:10:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:10:04,860 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 47 [2019-08-05 11:10:04,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:04,860 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:10:04,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:10:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:04,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:04,861 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:04,861 INFO L418 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:04,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:04,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1132223456, now seen corresponding path program 110 times [2019-08-05 11:10:04,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:04,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:04,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:10:05,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:05,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:05,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:05,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:05,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:05,317 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 15 states. [2019-08-05 11:10:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:05,377 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2019-08-05 11:10:05,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:05,377 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:05,378 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:10:05,378 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:10:05,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:10:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 61. [2019-08-05 11:10:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:10:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2019-08-05 11:10:05,382 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 47 [2019-08-05 11:10:05,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:05,382 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2019-08-05 11:10:05,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2019-08-05 11:10:05,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:05,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:05,383 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:05,383 INFO L418 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:05,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:05,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2135002206, now seen corresponding path program 111 times [2019-08-05 11:10:05,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:05,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:05,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:10:05,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:05,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:05,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:05,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:05,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:05,472 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 15 states. [2019-08-05 11:10:05,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:05,521 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2019-08-05 11:10:05,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:05,522 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:05,523 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:10:05,523 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:10:05,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:10:05,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2019-08-05 11:10:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:10:05,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:10:05,526 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 47 [2019-08-05 11:10:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:05,526 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:10:05,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:10:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:05,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:05,527 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:05,527 INFO L418 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:05,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:05,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1212706462, now seen corresponding path program 112 times [2019-08-05 11:10:05,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:05,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:05,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 11:10:05,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:05,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:05,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:05,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:05,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:05,683 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 15 states. [2019-08-05 11:10:05,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:05,736 INFO L93 Difference]: Finished difference Result 107 states and 132 transitions. [2019-08-05 11:10:05,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:05,739 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:05,740 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:10:05,740 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:10:05,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:05,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:10:05,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2019-08-05 11:10:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:05,742 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 47 [2019-08-05 11:10:05,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:05,742 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:05,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:05,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:05,743 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:05,743 INFO L418 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:05,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:05,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1985524256, now seen corresponding path program 113 times [2019-08-05 11:10:05,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:05,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:05,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:10:05,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:05,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:05,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:05,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:05,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:05,811 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 15 states. [2019-08-05 11:10:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:05,857 INFO L93 Difference]: Finished difference Result 107 states and 132 transitions. [2019-08-05 11:10:05,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:05,858 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:05,858 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:10:05,859 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:10:05,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:10:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2019-08-05 11:10:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:10:05,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:10:05,862 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 47 [2019-08-05 11:10:05,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:05,862 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:10:05,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:05,862 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:10:05,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:05,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:05,863 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:05,863 INFO L418 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:05,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:05,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1063228512, now seen corresponding path program 114 times [2019-08-05 11:10:05,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:05,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:05,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:06,264 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:10:06,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:06,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:06,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:06,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:06,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:06,265 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 15 states. [2019-08-05 11:10:06,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:06,314 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2019-08-05 11:10:06,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:06,315 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-08-05 11:10:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:06,315 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:10:06,315 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:10:06,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:10:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 51. [2019-08-05 11:10:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:10:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2019-08-05 11:10:06,318 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 47 [2019-08-05 11:10:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:06,318 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2019-08-05 11:10:06,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2019-08-05 11:10:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:06,319 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:06,319 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1] [2019-08-05 11:10:06,319 INFO L418 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:06,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:06,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1670813126, now seen corresponding path program 7 times [2019-08-05 11:10:06,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:06,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:06,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-08-05 11:10:06,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:06,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:06,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:06,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:06,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:06,739 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 17 states. [2019-08-05 11:10:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:06,804 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2019-08-05 11:10:06,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:06,805 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:06,806 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:10:06,806 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:10:06,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:10:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2019-08-05 11:10:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:06,809 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:06,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:06,809 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:06,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:06,809 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:06,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:06,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:06,810 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:06,810 INFO L418 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:06,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:06,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2101894280, now seen corresponding path program 115 times [2019-08-05 11:10:06,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:06,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:06,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:10:06,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:06,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:06,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:06,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:06,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:06,974 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:07,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:07,024 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2019-08-05 11:10:07,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:07,025 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:07,025 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:10:07,025 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:10:07,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:07,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:10:07,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2019-08-05 11:10:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:10:07,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:10:07,029 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 54 [2019-08-05 11:10:07,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:07,029 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:10:07,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:07,029 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:10:07,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:07,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:07,030 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:07,030 INFO L418 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:07,030 INFO L82 PathProgramCache]: Analyzing trace with hash -269485064, now seen corresponding path program 116 times [2019-08-05 11:10:07,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:07,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:07,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:10:07,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:07,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:07,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:07,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:07,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:07,239 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 17 states. [2019-08-05 11:10:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:07,294 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2019-08-05 11:10:07,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:07,294 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:07,295 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:10:07,295 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:10:07,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:10:07,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2019-08-05 11:10:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:07,298 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:07,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:07,298 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:07,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:07,298 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:07,299 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:07,299 INFO L418 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:07,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:07,299 INFO L82 PathProgramCache]: Analyzing trace with hash -700566218, now seen corresponding path program 117 times [2019-08-05 11:10:07,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:07,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:07,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:07,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:07,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:07,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:07,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:07,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:07,452 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:07,532 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2019-08-05 11:10:07,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:07,533 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:07,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:07,534 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:10:07,534 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:10:07,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:10:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2019-08-05 11:10:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:10:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2019-08-05 11:10:07,537 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 54 [2019-08-05 11:10:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:07,537 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2019-08-05 11:10:07,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:07,537 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2019-08-05 11:10:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:07,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:07,538 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:07,538 INFO L418 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:07,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:07,538 INFO L82 PathProgramCache]: Analyzing trace with hash -188811912, now seen corresponding path program 118 times [2019-08-05 11:10:07,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:07,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:07,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:10:07,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:07,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:07,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:07,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:07,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:07,819 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand 17 states. [2019-08-05 11:10:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:08,034 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2019-08-05 11:10:08,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:08,035 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:08,037 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:10:08,037 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:10:08,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:10:08,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-08-05 11:10:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:08,040 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:08,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:08,041 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:08,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:08,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:08,041 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:08,042 INFO L418 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:08,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash -619893066, now seen corresponding path program 119 times [2019-08-05 11:10:08,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:08,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:08,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:08,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:08,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:08,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:08,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:08,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:08,191 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:08,245 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2019-08-05 11:10:08,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:08,246 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:08,247 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:10:08,247 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:10:08,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:10:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 69. [2019-08-05 11:10:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:10:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:10:08,250 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 54 [2019-08-05 11:10:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:08,251 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:10:08,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:10:08,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:08,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:08,251 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:08,252 INFO L418 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:08,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:08,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1212516150, now seen corresponding path program 120 times [2019-08-05 11:10:08,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:08,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:08,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:08,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:08,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:08,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:08,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:08,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:08,343 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 17 states. [2019-08-05 11:10:08,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:08,431 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2019-08-05 11:10:08,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:08,431 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:08,432 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:10:08,432 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:10:08,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:08,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:10:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-08-05 11:10:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:08,434 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:08,435 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:08,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:08,435 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:08,435 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:08,436 INFO L418 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:08,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:08,436 INFO L82 PathProgramCache]: Analyzing trace with hash 781434996, now seen corresponding path program 121 times [2019-08-05 11:10:08,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:08,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:08,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:08,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:08,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:08,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:08,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:08,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:08,542 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:08,595 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2019-08-05 11:10:08,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:08,596 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:08,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:08,596 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:10:08,596 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:10:08,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:10:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 61. [2019-08-05 11:10:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:10:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2019-08-05 11:10:08,599 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 54 [2019-08-05 11:10:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:08,600 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2019-08-05 11:10:08,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2019-08-05 11:10:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:08,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:08,600 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:08,600 INFO L418 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:08,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:08,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1666313720, now seen corresponding path program 122 times [2019-08-05 11:10:08,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:08,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:08,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:10:08,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:08,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:08,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:08,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:08,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:08,708 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 17 states. [2019-08-05 11:10:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:08,758 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2019-08-05 11:10:08,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:08,758 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:08,759 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:10:08,759 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:10:08,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:10:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-08-05 11:10:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:08,763 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:08,763 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:08,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:08,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:08,763 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:08,763 INFO L418 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:08,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:08,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1235232566, now seen corresponding path program 123 times [2019-08-05 11:10:08,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:08,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:08,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:09,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:09,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:09,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:09,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:09,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:09,107 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:09,159 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2019-08-05 11:10:09,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:09,160 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:09,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:09,161 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:10:09,161 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:10:09,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:10:09,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 69. [2019-08-05 11:10:09,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:10:09,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:10:09,164 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 54 [2019-08-05 11:10:09,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:09,164 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:10:09,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:10:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:09,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:09,165 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:09,165 INFO L418 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:09,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:09,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1227325514, now seen corresponding path program 124 times [2019-08-05 11:10:09,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:09,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:09,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:09,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:09,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:09,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:09,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:09,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:09,302 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 17 states. [2019-08-05 11:10:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:09,464 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:09,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:09,464 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:09,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:09,465 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:09,465 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:09,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 73. [2019-08-05 11:10:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:09,468 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:09,468 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:09,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:09,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:09,469 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:09,469 INFO L418 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:09,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:09,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1658406668, now seen corresponding path program 125 times [2019-08-05 11:10:09,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:09,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:09,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:10,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:10,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:10,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:10,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:10,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:10,006 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:10,056 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:10,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:10,057 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:10,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:10,057 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:10,058 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:10,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:10,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 65. [2019-08-05 11:10:10,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:10:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2019-08-05 11:10:10,060 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 54 [2019-08-05 11:10:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:10,061 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2019-08-05 11:10:10,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2019-08-05 11:10:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:10,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:10,061 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:10,061 INFO L418 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:10,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:10,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1146652362, now seen corresponding path program 126 times [2019-08-05 11:10:10,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:10,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:10,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:10,182 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:10,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:10,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:10,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:10,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:10,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:10,184 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand 17 states. [2019-08-05 11:10:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:10,233 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:10,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:10,233 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:10,234 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:10,234 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:10,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 73. [2019-08-05 11:10:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:10,237 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:10,237 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:10,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:10,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:10,238 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:10,238 INFO L418 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:10,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:10,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1577733516, now seen corresponding path program 127 times [2019-08-05 11:10:10,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:10,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:10,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:10,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:10,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:10,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:10,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:10,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:10,339 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:10,393 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:10,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:10,393 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:10,394 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:10,394 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:10,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 69. [2019-08-05 11:10:10,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:10:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:10:10,397 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 54 [2019-08-05 11:10:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:10,397 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:10:10,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:10:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:10,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:10,398 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:10,398 INFO L418 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:10,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:10,398 INFO L82 PathProgramCache]: Analyzing trace with hash 254675700, now seen corresponding path program 128 times [2019-08-05 11:10:10,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:10,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:10,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:10,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:10,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:10,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:10,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:10,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:10,498 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 17 states. [2019-08-05 11:10:10,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:10,622 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2019-08-05 11:10:10,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:10,623 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:10,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:10,623 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:10:10,624 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:10:10,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:10:10,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 73. [2019-08-05 11:10:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:10,627 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:10,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:10,627 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:10,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:10,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:10,628 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:10,628 INFO L418 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:10,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:10,629 INFO L82 PathProgramCache]: Analyzing trace with hash -176405454, now seen corresponding path program 129 times [2019-08-05 11:10:10,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:10,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:10,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:10,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:10,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:10,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:10,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:10,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:10,719 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:10,821 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2019-08-05 11:10:10,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:10,821 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:10,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:10,822 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:10:10,822 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:10:10,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:10:10,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 57. [2019-08-05 11:10:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:10:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2019-08-05 11:10:10,827 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 54 [2019-08-05 11:10:10,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:10,827 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2019-08-05 11:10:10,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2019-08-05 11:10:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:10,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:10,827 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:10,828 INFO L418 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:10,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:10,828 INFO L82 PathProgramCache]: Analyzing trace with hash -769112200, now seen corresponding path program 130 times [2019-08-05 11:10:10,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:10,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:10,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:10:11,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:11,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:11,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:11,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:11,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:11,121 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 17 states. [2019-08-05 11:10:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:11,172 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2019-08-05 11:10:11,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:11,175 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:11,175 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:10:11,175 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:10:11,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:11,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:10:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2019-08-05 11:10:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:11,179 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:11,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:11,179 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:11,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:11,179 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:11,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:11,179 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:11,180 INFO L418 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:11,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:11,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1200193354, now seen corresponding path program 131 times [2019-08-05 11:10:11,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:11,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:11,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:11,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:11,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:11,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:11,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:11,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:11,267 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:11,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:11,327 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2019-08-05 11:10:11,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:11,328 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:11,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:11,329 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:10:11,329 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:10:11,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:11,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:10:11,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 69. [2019-08-05 11:10:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:10:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:10:11,332 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 54 [2019-08-05 11:10:11,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:11,332 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:10:11,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:10:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:11,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:11,332 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:11,333 INFO L418 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:11,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:11,333 INFO L82 PathProgramCache]: Analyzing trace with hash 632215862, now seen corresponding path program 132 times [2019-08-05 11:10:11,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:11,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:11,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:11,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:11,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:11,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:11,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:11,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:11,427 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 17 states. [2019-08-05 11:10:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:11,483 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:11,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:11,483 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:11,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:11,484 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:11,484 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:11,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:11,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:11,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 73. [2019-08-05 11:10:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:11,487 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:11,488 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:11,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:11,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:11,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:11,488 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:11,489 INFO L418 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:11,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:11,489 INFO L82 PathProgramCache]: Analyzing trace with hash 201134708, now seen corresponding path program 133 times [2019-08-05 11:10:11,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:11,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:11,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:11,646 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:11,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:11,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:11,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:11,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:11,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:11,647 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:11,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:11,715 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:11,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:11,715 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:11,716 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:11,716 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:11,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:11,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:11,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 65. [2019-08-05 11:10:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:10:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2019-08-05 11:10:11,719 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 54 [2019-08-05 11:10:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:11,719 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2019-08-05 11:10:11,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:11,720 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2019-08-05 11:10:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:11,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:11,720 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:11,720 INFO L418 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:11,720 INFO L82 PathProgramCache]: Analyzing trace with hash 712889014, now seen corresponding path program 134 times [2019-08-05 11:10:11,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:11,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:11,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:12,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:12,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:12,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:12,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:12,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:12,005 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand 17 states. [2019-08-05 11:10:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:12,058 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2019-08-05 11:10:12,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:12,058 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:12,059 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:10:12,059 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:10:12,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:10:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2019-08-05 11:10:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:12,062 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:12,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:12,062 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:12,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:12,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:12,062 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:12,062 INFO L418 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:12,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:12,063 INFO L82 PathProgramCache]: Analyzing trace with hash 281807860, now seen corresponding path program 135 times [2019-08-05 11:10:12,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:12,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:12,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:12,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:12,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:12,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:12,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:12,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:12,159 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:12,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:12,212 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2019-08-05 11:10:12,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:12,212 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:12,213 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:10:12,213 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:10:12,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:10:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 69. [2019-08-05 11:10:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:10:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:10:12,216 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 54 [2019-08-05 11:10:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:12,217 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:10:12,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:12,217 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:10:12,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:12,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:12,217 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:12,218 INFO L418 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:12,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:12,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2114217076, now seen corresponding path program 136 times [2019-08-05 11:10:12,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:12,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:12,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:12,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:12,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:12,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:12,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:12,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:12,303 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 17 states. [2019-08-05 11:10:12,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:12,449 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2019-08-05 11:10:12,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:12,449 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:12,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:12,450 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:10:12,450 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:10:12,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:12,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:10:12,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2019-08-05 11:10:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:12,453 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:12,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:12,453 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:12,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:12,453 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:12,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:12,454 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:12,454 INFO L418 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:12,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1683135922, now seen corresponding path program 137 times [2019-08-05 11:10:12,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:12,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:12,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:12,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:12,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:12,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:12,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:12,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:12,547 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:12,602 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2019-08-05 11:10:12,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:12,603 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:12,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:12,604 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:10:12,604 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:10:12,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:10:12,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 61. [2019-08-05 11:10:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:10:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2019-08-05 11:10:12,607 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 54 [2019-08-05 11:10:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:12,607 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2019-08-05 11:10:12,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2019-08-05 11:10:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:12,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:12,607 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:12,607 INFO L418 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:12,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:12,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1726952650, now seen corresponding path program 138 times [2019-08-05 11:10:12,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:12,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:12,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:12,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:12,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:12,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:12,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:12,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:12,720 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 17 states. [2019-08-05 11:10:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:12,774 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2019-08-05 11:10:12,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:12,775 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:12,776 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:10:12,776 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:10:12,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:10:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2019-08-05 11:10:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:12,778 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:12,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:12,779 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:12,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:12,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:12,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:12,779 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:12,779 INFO L418 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:12,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:12,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2136933492, now seen corresponding path program 139 times [2019-08-05 11:10:12,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:12,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:12,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:12,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:12,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:12,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:12,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:12,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:12,913 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:12,965 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2019-08-05 11:10:12,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:12,966 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:12,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:12,966 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:10:12,967 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:10:12,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:12,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:10:12,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 69. [2019-08-05 11:10:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:10:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:10:12,969 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 54 [2019-08-05 11:10:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:12,970 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:10:12,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:10:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:12,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:12,970 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:12,970 INFO L418 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:12,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:12,971 INFO L82 PathProgramCache]: Analyzing trace with hash -325624588, now seen corresponding path program 140 times [2019-08-05 11:10:12,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:12,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:12,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:13,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:13,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:13,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:13,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:13,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:13,070 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 17 states. [2019-08-05 11:10:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:13,164 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2019-08-05 11:10:13,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:13,165 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:13,166 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:10:13,166 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:10:13,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:10:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2019-08-05 11:10:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:13,169 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:13,169 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:13,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:13,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:13,170 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:13,170 INFO L418 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:13,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:13,170 INFO L82 PathProgramCache]: Analyzing trace with hash -756705742, now seen corresponding path program 141 times [2019-08-05 11:10:13,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:13,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:13,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:13,265 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:13,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:13,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:13,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:13,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:13,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:13,266 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:13,339 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2019-08-05 11:10:13,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:13,340 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:13,341 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:10:13,341 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:10:13,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:10:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 65. [2019-08-05 11:10:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:10:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2019-08-05 11:10:13,344 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 54 [2019-08-05 11:10:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:13,344 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2019-08-05 11:10:13,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2019-08-05 11:10:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:13,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:13,345 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:13,345 INFO L418 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:13,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:13,345 INFO L82 PathProgramCache]: Analyzing trace with hash -244951436, now seen corresponding path program 142 times [2019-08-05 11:10:13,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:13,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:13,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:13,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:13,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:13,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:13,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:13,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:13,555 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand 17 states. [2019-08-05 11:10:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:13,621 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:13,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:13,622 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:13,623 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:13,623 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:13,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 73. [2019-08-05 11:10:13,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:13,625 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:13,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:13,625 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:13,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:13,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:13,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:13,626 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:13,626 INFO L418 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:13,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:13,626 INFO L82 PathProgramCache]: Analyzing trace with hash -676032590, now seen corresponding path program 143 times [2019-08-05 11:10:13,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:13,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:13,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:13,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:13,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:13,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:13,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:13,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:13,714 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:13,769 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:13,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:13,769 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:13,770 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:13,770 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:13,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 69. [2019-08-05 11:10:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:10:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-08-05 11:10:13,773 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 54 [2019-08-05 11:10:13,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:13,773 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-08-05 11:10:13,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-08-05 11:10:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:13,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:13,773 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:13,774 INFO L418 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:13,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1156376626, now seen corresponding path program 144 times [2019-08-05 11:10:13,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:13,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:13,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:13,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:13,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:13,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:13,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:13,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:13,858 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 17 states. [2019-08-05 11:10:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:13,914 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2019-08-05 11:10:13,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:13,915 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:13,916 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:10:13,916 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:10:13,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:13,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:10:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-08-05 11:10:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:10:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-08-05 11:10:13,919 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 54 [2019-08-05 11:10:13,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:13,919 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-08-05 11:10:13,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-08-05 11:10:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:13,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:13,920 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:13,920 INFO L418 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:13,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:13,921 INFO L82 PathProgramCache]: Analyzing trace with hash 725295472, now seen corresponding path program 145 times [2019-08-05 11:10:13,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:13,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:13,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:14,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:14,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:14,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:14,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:14,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:14,051 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 17 states. [2019-08-05 11:10:14,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:14,111 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2019-08-05 11:10:14,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:14,112 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:14,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:14,112 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:10:14,113 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:10:14,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:10:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 55. [2019-08-05 11:10:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:10:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-08-05 11:10:14,115 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 54 [2019-08-05 11:10:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:14,115 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-08-05 11:10:14,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-08-05 11:10:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:14,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:14,116 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:14,116 INFO L418 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:14,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:14,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1337073672, now seen corresponding path program 146 times [2019-08-05 11:10:14,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:14,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:14,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:10:14,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:14,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:14,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:14,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:14,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:14,213 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 17 states. [2019-08-05 11:10:14,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:14,259 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2019-08-05 11:10:14,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:14,259 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:14,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:14,260 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:10:14,260 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:10:14,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:10:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 75. [2019-08-05 11:10:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:14,263 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:14,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:14,263 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:14,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:14,263 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:14,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:14,270 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:14,270 INFO L418 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:14,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:14,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1768154826, now seen corresponding path program 147 times [2019-08-05 11:10:14,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:14,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:14,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:14,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:14,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:14,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:14,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:14,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:14,374 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:14,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:14,428 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2019-08-05 11:10:14,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:14,429 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:14,430 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:10:14,430 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:10:14,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:10:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 71. [2019-08-05 11:10:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:10:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2019-08-05 11:10:14,434 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 54 [2019-08-05 11:10:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:14,434 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2019-08-05 11:10:14,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2019-08-05 11:10:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:14,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:14,435 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:14,435 INFO L418 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:14,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:14,435 INFO L82 PathProgramCache]: Analyzing trace with hash 64254390, now seen corresponding path program 148 times [2019-08-05 11:10:14,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:14,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:14,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:14,530 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:14,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:14,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:14,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:14,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:14,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:14,531 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand 17 states. [2019-08-05 11:10:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:14,629 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2019-08-05 11:10:14,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:14,629 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:14,630 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:10:14,630 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:10:14,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:14,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:10:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 75. [2019-08-05 11:10:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:14,632 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:14,632 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:14,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:14,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:14,633 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:14,633 INFO L418 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:14,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:14,633 INFO L82 PathProgramCache]: Analyzing trace with hash -366826764, now seen corresponding path program 149 times [2019-08-05 11:10:14,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:14,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:14,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:14,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:14,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:14,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:14,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:14,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:14,731 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:14,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:14,814 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2019-08-05 11:10:14,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:14,819 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:14,820 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:10:14,820 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:10:14,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:14,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:10:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 67. [2019-08-05 11:10:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:10:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2019-08-05 11:10:14,823 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 54 [2019-08-05 11:10:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:14,823 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2019-08-05 11:10:14,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2019-08-05 11:10:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:14,824 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:14,824 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:14,824 INFO L418 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:14,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:14,824 INFO L82 PathProgramCache]: Analyzing trace with hash 144927542, now seen corresponding path program 150 times [2019-08-05 11:10:14,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:14,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:14,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:14,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:14,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:14,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:14,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:14,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:14,919 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand 17 states. [2019-08-05 11:10:14,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:14,973 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:14,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:14,973 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:14,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:14,974 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:14,974 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:14,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:14,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 75. [2019-08-05 11:10:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:14,978 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:14,978 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:14,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:14,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:14,979 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:14,979 INFO L418 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:14,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:14,979 INFO L82 PathProgramCache]: Analyzing trace with hash -286153612, now seen corresponding path program 151 times [2019-08-05 11:10:14,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:14,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:14,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:15,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:15,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:15,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:15,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:15,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:15,075 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:15,128 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:15,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:15,129 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:15,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:15,130 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:15,130 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:15,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 71. [2019-08-05 11:10:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:10:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2019-08-05 11:10:15,132 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 54 [2019-08-05 11:10:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:15,133 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2019-08-05 11:10:15,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2019-08-05 11:10:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:15,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:15,133 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:15,134 INFO L418 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1546255604, now seen corresponding path program 152 times [2019-08-05 11:10:15,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:15,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:15,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:15,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:15,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:15,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:15,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:15,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:15,231 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand 17 states. [2019-08-05 11:10:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:15,285 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:15,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:15,285 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:15,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:15,286 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:15,286 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:15,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:15,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 75. [2019-08-05 11:10:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:15,289 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:15,289 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:15,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:15,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:15,290 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:15,290 INFO L418 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:15,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:15,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1115174450, now seen corresponding path program 153 times [2019-08-05 11:10:15,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:15,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:15,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:15,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:15,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:15,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:15,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:15,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:15,380 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:15,427 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:15,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:15,428 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:15,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:15,429 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:15,429 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:15,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 63. [2019-08-05 11:10:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:10:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2019-08-05 11:10:15,431 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 54 [2019-08-05 11:10:15,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:15,432 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2019-08-05 11:10:15,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:15,432 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2019-08-05 11:10:15,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:15,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:15,432 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:15,432 INFO L418 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:15,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:15,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2000053174, now seen corresponding path program 154 times [2019-08-05 11:10:15,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:15,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:15,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:15,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:15,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:15,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:15,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:15,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:15,540 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand 17 states. [2019-08-05 11:10:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:15,590 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:15,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:15,590 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:15,591 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:15,591 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:15,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 75. [2019-08-05 11:10:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:15,594 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:15,595 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:15,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:15,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:15,595 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:15,595 INFO L418 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1568972020, now seen corresponding path program 155 times [2019-08-05 11:10:15,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:15,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:15,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:15,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:15,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:15,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:15,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:15,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:15,703 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:15,756 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:15,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:15,757 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:15,758 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:15,758 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:15,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 71. [2019-08-05 11:10:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:10:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2019-08-05 11:10:15,761 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 54 [2019-08-05 11:10:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:15,761 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2019-08-05 11:10:15,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2019-08-05 11:10:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:15,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:15,762 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:15,762 INFO L418 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:15,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:15,762 INFO L82 PathProgramCache]: Analyzing trace with hash -893586060, now seen corresponding path program 156 times [2019-08-05 11:10:15,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:15,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:15,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:15,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:15,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:15,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:15,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:15,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:15,869 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand 17 states. [2019-08-05 11:10:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:15,921 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:15,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:15,922 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:15,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:15,923 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:15,923 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:15,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:15,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:15,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 75. [2019-08-05 11:10:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:15,926 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:15,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:15,926 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:15,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:15,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:15,927 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:15,927 INFO L418 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:15,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1324667214, now seen corresponding path program 157 times [2019-08-05 11:10:15,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:15,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:15,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:16,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:16,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:16,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:16,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:16,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:16,007 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:16,053 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:16,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:16,053 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:16,054 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:16,055 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:16,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:16,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 67. [2019-08-05 11:10:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:10:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2019-08-05 11:10:16,058 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 54 [2019-08-05 11:10:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:16,059 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2019-08-05 11:10:16,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2019-08-05 11:10:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:16,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:16,059 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:16,060 INFO L418 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:16,060 INFO L82 PathProgramCache]: Analyzing trace with hash -812912908, now seen corresponding path program 158 times [2019-08-05 11:10:16,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:16,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:16,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:16,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:16,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:16,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:16,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:16,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:16,286 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand 17 states. [2019-08-05 11:10:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:16,342 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2019-08-05 11:10:16,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:16,342 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:16,343 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:10:16,343 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:10:16,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:10:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 75. [2019-08-05 11:10:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:16,346 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:16,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:16,346 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:16,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:16,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:16,347 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:16,347 INFO L418 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:16,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:16,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1243994062, now seen corresponding path program 159 times [2019-08-05 11:10:16,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:16,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:16,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:16,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:16,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:16,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:16,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:16,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:16,436 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:16,491 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2019-08-05 11:10:16,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:16,492 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:16,493 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:10:16,493 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:10:16,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:16,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:10:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 71. [2019-08-05 11:10:16,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:10:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2019-08-05 11:10:16,496 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 54 [2019-08-05 11:10:16,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:16,496 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2019-08-05 11:10:16,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2019-08-05 11:10:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:16,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:16,497 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:16,497 INFO L418 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:16,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:16,497 INFO L82 PathProgramCache]: Analyzing trace with hash 588415154, now seen corresponding path program 160 times [2019-08-05 11:10:16,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:16,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:16,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:17,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:17,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:17,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:17,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:17,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:17,080 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand 17 states. [2019-08-05 11:10:17,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:17,138 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2019-08-05 11:10:17,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:17,138 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:17,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:17,139 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:10:17,139 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:10:17,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:10:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 75. [2019-08-05 11:10:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:17,142 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:17,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:17,142 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:17,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:17,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:17,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:17,143 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:17,143 INFO L418 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:17,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:17,143 INFO L82 PathProgramCache]: Analyzing trace with hash 157334000, now seen corresponding path program 161 times [2019-08-05 11:10:17,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:17,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:17,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:17,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:17,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:17,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:17,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:17,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:17,805 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:17,858 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2019-08-05 11:10:17,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:17,858 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:17,859 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:10:17,859 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:10:17,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:17,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:10:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 59. [2019-08-05 11:10:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:10:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2019-08-05 11:10:17,862 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 54 [2019-08-05 11:10:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:17,862 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2019-08-05 11:10:17,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2019-08-05 11:10:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:17,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:17,863 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:17,863 INFO L418 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:17,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:17,863 INFO L82 PathProgramCache]: Analyzing trace with hash -435372746, now seen corresponding path program 162 times [2019-08-05 11:10:17,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:17,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:17,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:17,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:17,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:17,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:17,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:17,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:17,950 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 17 states. [2019-08-05 11:10:18,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:18,005 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2019-08-05 11:10:18,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:18,006 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:18,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:18,006 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:10:18,006 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:10:18,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:10:18,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 75. [2019-08-05 11:10:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:18,009 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:18,009 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:18,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:18,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:18,010 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:18,010 INFO L418 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:18,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:18,010 INFO L82 PathProgramCache]: Analyzing trace with hash -866453900, now seen corresponding path program 163 times [2019-08-05 11:10:18,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:18,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:18,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:18,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:18,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:18,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:18,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:18,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:18,096 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:18,155 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-08-05 11:10:18,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:18,155 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:18,156 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:10:18,156 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:10:18,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:18,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:10:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 71. [2019-08-05 11:10:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:10:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2019-08-05 11:10:18,159 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 54 [2019-08-05 11:10:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:18,160 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2019-08-05 11:10:18,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2019-08-05 11:10:18,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:18,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:18,160 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:18,160 INFO L418 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:18,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:18,161 INFO L82 PathProgramCache]: Analyzing trace with hash 965955316, now seen corresponding path program 164 times [2019-08-05 11:10:18,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:18,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:18,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:18,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:18,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:18,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:18,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:18,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:18,456 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand 17 states. [2019-08-05 11:10:18,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:18,509 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2019-08-05 11:10:18,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:18,510 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:18,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:18,510 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:10:18,511 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:10:18,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:18,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:10:18,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 75. [2019-08-05 11:10:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:18,514 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:18,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:18,514 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:18,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:18,514 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:18,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:18,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:18,515 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:18,515 INFO L418 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:18,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:18,515 INFO L82 PathProgramCache]: Analyzing trace with hash 534874162, now seen corresponding path program 165 times [2019-08-05 11:10:18,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:18,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:18,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:18,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:18,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:18,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:18,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:18,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:18,622 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:18,672 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2019-08-05 11:10:18,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:18,673 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:18,674 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:10:18,674 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:10:18,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:18,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:10:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 67. [2019-08-05 11:10:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:10:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2019-08-05 11:10:18,676 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 54 [2019-08-05 11:10:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:18,676 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2019-08-05 11:10:18,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2019-08-05 11:10:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:18,677 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:18,677 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:18,677 INFO L418 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:18,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:18,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1046628468, now seen corresponding path program 166 times [2019-08-05 11:10:18,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:18,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:18,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:18,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:18,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:18,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:18,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:18,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:18,994 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand 17 states. [2019-08-05 11:10:19,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:19,052 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2019-08-05 11:10:19,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:19,053 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:19,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:19,054 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:10:19,054 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:10:19,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:10:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 75. [2019-08-05 11:10:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:19,057 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:19,057 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:19,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:19,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:19,057 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:19,058 INFO L418 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:19,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:19,058 INFO L82 PathProgramCache]: Analyzing trace with hash 615547314, now seen corresponding path program 167 times [2019-08-05 11:10:19,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:19,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:19,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:19,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:19,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:19,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:19,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:19,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:19,167 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:19,225 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2019-08-05 11:10:19,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:19,225 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:19,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:19,226 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:10:19,226 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:10:19,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:19,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:10:19,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 71. [2019-08-05 11:10:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:10:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2019-08-05 11:10:19,229 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 54 [2019-08-05 11:10:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:19,230 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2019-08-05 11:10:19,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2019-08-05 11:10:19,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:19,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:19,231 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:19,231 INFO L418 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:19,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:19,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1847010766, now seen corresponding path program 168 times [2019-08-05 11:10:19,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:19,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:19,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:19,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:19,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:19,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:19,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:19,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:19,315 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand 17 states. [2019-08-05 11:10:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:19,371 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-08-05 11:10:19,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:19,372 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:19,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:19,373 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:10:19,373 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:10:19,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:10:19,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 75. [2019-08-05 11:10:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:19,376 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:19,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:19,376 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:19,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:19,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:19,376 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:19,376 INFO L418 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:19,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:19,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1059034926, now seen corresponding path program 169 times [2019-08-05 11:10:19,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:19,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:19,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:10:19,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:19,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:19,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:19,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:19,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:19,469 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:19,515 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2019-08-05 11:10:19,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:19,516 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:19,517 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:10:19,517 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:10:19,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:10:19,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 87. [2019-08-05 11:10:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:19,519 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 54 [2019-08-05 11:10:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:19,519 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:19,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:19,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:19,520 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:19,520 INFO L418 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:19,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:19,520 INFO L82 PathProgramCache]: Analyzing trace with hash 2016875376, now seen corresponding path program 170 times [2019-08-05 11:10:19,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:19,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:19,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:19,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:19,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:19,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:19,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:19,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:19,657 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 17 states. [2019-08-05 11:10:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:19,725 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:19,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:19,726 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:19,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:19,727 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:19,727 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:19,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:19,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:19,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2019-08-05 11:10:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:19,731 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:19,731 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:19,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:19,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:19,732 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:19,732 INFO L418 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:19,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:19,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1393213196, now seen corresponding path program 171 times [2019-08-05 11:10:19,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:19,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:19,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:19,996 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:19,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:19,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:19,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:19,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:19,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:19,997 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:20,065 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:20,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:20,066 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:20,067 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:20,067 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:20,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:20,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 83. [2019-08-05 11:10:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:20,070 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 54 [2019-08-05 11:10:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:20,070 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:20,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:20,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:20,071 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:20,071 INFO L418 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:20,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:20,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1824294350, now seen corresponding path program 172 times [2019-08-05 11:10:20,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:20,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:20,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:20,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:20,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:20,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:20,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:20,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:20,158 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 17 states. [2019-08-05 11:10:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:20,210 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:20,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:20,210 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:20,211 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:20,211 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:20,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:20,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 79. [2019-08-05 11:10:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:20,214 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:20,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:20,214 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:20,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:20,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:20,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:20,215 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:20,215 INFO L418 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:20,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:20,215 INFO L82 PathProgramCache]: Analyzing trace with hash 8114866, now seen corresponding path program 173 times [2019-08-05 11:10:20,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:20,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:20,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:20,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:20,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:20,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:20,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:20,303 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:20,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:20,357 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:20,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:20,358 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:20,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:20,358 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:20,359 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:20,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:20,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 83. [2019-08-05 11:10:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:20,362 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 54 [2019-08-05 11:10:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:20,362 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:20,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:20,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:20,362 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:20,363 INFO L418 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:20,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:20,363 INFO L82 PathProgramCache]: Analyzing trace with hash -422966288, now seen corresponding path program 174 times [2019-08-05 11:10:20,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:20,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:20,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:20,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:20,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:20,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:20,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:20,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:20,452 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 17 states. [2019-08-05 11:10:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:20,507 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:20,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:20,508 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:20,508 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:20,509 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:20,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2019-08-05 11:10:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:20,511 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:20,512 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:20,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:20,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:20,512 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:20,513 INFO L418 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:20,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:20,513 INFO L82 PathProgramCache]: Analyzing trace with hash 88788018, now seen corresponding path program 175 times [2019-08-05 11:10:20,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:20,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:20,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:20,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:20,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:20,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:20,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:20,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:20,842 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:20,910 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-08-05 11:10:20,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:20,911 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:20,911 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:10:20,911 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:10:20,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:10:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 79. [2019-08-05 11:10:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:20,914 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:20,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:20,914 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:20,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:20,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:20,915 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:20,915 INFO L418 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:20,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:20,915 INFO L82 PathProgramCache]: Analyzing trace with hash -342293136, now seen corresponding path program 176 times [2019-08-05 11:10:20,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:20,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:20,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:21,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:21,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:21,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:21,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:21,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:21,004 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:21,057 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-08-05 11:10:21,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:21,057 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:21,058 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:10:21,058 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:10:21,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:10:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 75. [2019-08-05 11:10:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:21,061 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:21,061 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:21,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:21,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:21,062 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:21,062 INFO L418 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:21,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:21,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1490116080, now seen corresponding path program 177 times [2019-08-05 11:10:21,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:21,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:21,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:21,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:21,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:21,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:21,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:21,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:21,151 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:21,204 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2019-08-05 11:10:21,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:21,205 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:21,205 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:10:21,206 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:10:21,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:10:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 55. [2019-08-05 11:10:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:10:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-08-05 11:10:21,208 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 54 [2019-08-05 11:10:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:21,208 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-08-05 11:10:21,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:21,209 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-08-05 11:10:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:21,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:21,209 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:21,209 INFO L418 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:21,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:21,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1207146872, now seen corresponding path program 178 times [2019-08-05 11:10:21,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:21,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:21,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:10:21,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:21,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:21,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:21,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:21,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:21,317 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 17 states. [2019-08-05 11:10:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:21,368 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2019-08-05 11:10:21,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:21,368 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:21,369 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:10:21,369 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:10:21,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:10:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2019-08-05 11:10:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:21,373 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:21,373 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:21,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:21,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:21,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:21,374 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:21,374 INFO L418 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:21,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash 776065718, now seen corresponding path program 179 times [2019-08-05 11:10:21,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:21,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:21,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:21,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:21,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:21,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:21,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:21,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:21,478 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:21,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:21,537 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2019-08-05 11:10:21,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:21,537 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:21,538 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:10:21,539 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:10:21,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:21,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:10:21,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 75. [2019-08-05 11:10:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:21,542 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:21,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:21,542 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:21,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:21,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:21,543 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:21,543 INFO L418 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:21,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:21,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1686492362, now seen corresponding path program 180 times [2019-08-05 11:10:21,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:21,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:21,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:21,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:21,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:21,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:21,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:21,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:21,677 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:21,725 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2019-08-05 11:10:21,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:21,726 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:21,726 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:10:21,727 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:10:21,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:21,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:10:21,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 79. [2019-08-05 11:10:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:21,729 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:21,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:21,730 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:21,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:21,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:21,730 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:21,730 INFO L418 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:21,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2117573516, now seen corresponding path program 181 times [2019-08-05 11:10:21,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:21,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:21,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:22,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:22,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:22,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:22,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:22,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:22,042 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:22,128 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2019-08-05 11:10:22,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:22,129 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:22,129 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:10:22,129 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:10:22,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:22,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:10:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 71. [2019-08-05 11:10:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:10:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2019-08-05 11:10:22,132 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 54 [2019-08-05 11:10:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:22,133 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2019-08-05 11:10:22,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2019-08-05 11:10:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:22,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:22,133 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:22,133 INFO L418 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:22,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:22,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1605819210, now seen corresponding path program 182 times [2019-08-05 11:10:22,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:22,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:22,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:22,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:22,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:22,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:22,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:22,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:22,276 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand 17 states. [2019-08-05 11:10:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:22,330 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-08-05 11:10:22,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:22,331 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:22,332 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:10:22,332 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:10:22,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:22,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:10:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 79. [2019-08-05 11:10:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:22,335 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:22,335 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:22,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:22,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:22,335 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:22,336 INFO L418 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:22,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2036900364, now seen corresponding path program 183 times [2019-08-05 11:10:22,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:22,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:22,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:22,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:22,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:22,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:22,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:22,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:22,427 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:22,481 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-08-05 11:10:22,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:22,481 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:22,482 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:10:22,482 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:10:22,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:22,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:10:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 75. [2019-08-05 11:10:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:22,485 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:22,485 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:22,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:22,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:22,486 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:22,486 INFO L418 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:22,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:22,486 INFO L82 PathProgramCache]: Analyzing trace with hash -204491148, now seen corresponding path program 184 times [2019-08-05 11:10:22,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:22,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:22,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:22,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:22,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:22,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:22,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:22,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:22,600 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:22,655 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-08-05 11:10:22,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:22,655 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:22,656 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:10:22,656 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:10:22,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:10:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 79. [2019-08-05 11:10:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:22,659 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:22,659 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:22,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:22,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:22,660 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:22,660 INFO L418 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:22,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:22,660 INFO L82 PathProgramCache]: Analyzing trace with hash -635572302, now seen corresponding path program 185 times [2019-08-05 11:10:22,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:22,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:22,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:22,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:22,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:22,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:22,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:22,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:22,746 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:22,806 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-08-05 11:10:22,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:22,807 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:22,808 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:10:22,808 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:10:22,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:22,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:10:22,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 67. [2019-08-05 11:10:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:10:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2019-08-05 11:10:22,811 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 54 [2019-08-05 11:10:22,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:22,811 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2019-08-05 11:10:22,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2019-08-05 11:10:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:22,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:22,811 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:22,812 INFO L418 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:22,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:22,812 INFO L82 PathProgramCache]: Analyzing trace with hash 249306422, now seen corresponding path program 186 times [2019-08-05 11:10:22,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:22,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:22,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:22,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:22,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:22,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:22,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:22,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:22,904 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand 17 states. [2019-08-05 11:10:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:22,955 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2019-08-05 11:10:22,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:22,955 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:22,956 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:10:22,956 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:10:22,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:10:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 79. [2019-08-05 11:10:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:22,959 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:22,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:22,959 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:22,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:22,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:22,960 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:22,960 INFO L418 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash -181774732, now seen corresponding path program 187 times [2019-08-05 11:10:22,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:22,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:22,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:23,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:23,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:23,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:23,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:23,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:23,068 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:23,124 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-08-05 11:10:23,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:23,125 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:23,125 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:10:23,126 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:10:23,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:10:23,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 75. [2019-08-05 11:10:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:23,128 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:23,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:23,128 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:23,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:23,129 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:23,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:23,129 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:23,129 INFO L418 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:23,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:23,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1650634484, now seen corresponding path program 188 times [2019-08-05 11:10:23,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:23,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:23,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:23,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:23,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:23,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:23,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:23,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:23,215 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:23,269 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2019-08-05 11:10:23,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:23,270 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:23,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:23,271 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:10:23,271 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:10:23,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:10:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 79. [2019-08-05 11:10:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:23,274 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:23,274 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:23,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:23,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:23,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:23,274 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:23,274 INFO L418 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:23,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:23,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1219553330, now seen corresponding path program 189 times [2019-08-05 11:10:23,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:23,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:23,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:23,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:23,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:23,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:23,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:23,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:23,368 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:23,419 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2019-08-05 11:10:23,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:23,420 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:23,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:23,421 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:10:23,421 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:10:23,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:10:23,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 71. [2019-08-05 11:10:23,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:10:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2019-08-05 11:10:23,424 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 54 [2019-08-05 11:10:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:23,424 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2019-08-05 11:10:23,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2019-08-05 11:10:23,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:23,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:23,424 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:23,424 INFO L418 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:23,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:23,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1731307636, now seen corresponding path program 190 times [2019-08-05 11:10:23,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:23,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:23,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:23,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:23,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:23,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:23,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:23,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:23,761 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand 17 states. [2019-08-05 11:10:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:23,813 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2019-08-05 11:10:23,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:23,813 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:23,814 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:10:23,814 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:10:23,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:10:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 79. [2019-08-05 11:10:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:23,817 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:23,818 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:23,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:23,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:23,818 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:23,818 INFO L418 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:23,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1300226482, now seen corresponding path program 191 times [2019-08-05 11:10:23,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:23,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:23,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:23,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:23,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:23,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:23,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:23,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:23,980 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:24,035 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2019-08-05 11:10:24,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:24,036 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:24,037 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:10:24,037 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:10:24,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:24,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:10:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 75. [2019-08-05 11:10:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:24,040 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:24,040 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:24,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:24,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:24,041 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:24,041 INFO L418 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:24,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:24,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1162331598, now seen corresponding path program 192 times [2019-08-05 11:10:24,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:24,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:24,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:24,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:24,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:24,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:24,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:24,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:24,455 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:24,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:24,513 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-08-05 11:10:24,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:24,514 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:24,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:24,514 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:10:24,515 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:10:24,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:10:24,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 79. [2019-08-05 11:10:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:24,518 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:24,518 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:24,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:24,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:24,518 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:24,519 INFO L418 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:24,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:24,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1593412752, now seen corresponding path program 193 times [2019-08-05 11:10:24,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:24,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:24,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:24,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:24,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:24,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:24,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:24,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:24,608 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:24,659 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2019-08-05 11:10:24,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:24,659 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:24,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:24,660 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:10:24,660 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:10:24,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:24,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:10:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 63. [2019-08-05 11:10:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:10:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2019-08-05 11:10:24,664 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 54 [2019-08-05 11:10:24,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:24,664 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2019-08-05 11:10:24,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:24,665 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2019-08-05 11:10:24,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:24,665 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:24,665 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:24,665 INFO L418 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:24,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:24,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2108847798, now seen corresponding path program 194 times [2019-08-05 11:10:24,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:24,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:24,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:25,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:25,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:25,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:25,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:25,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:25,011 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand 17 states. [2019-08-05 11:10:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:25,063 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-08-05 11:10:25,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:25,064 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:25,065 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:10:25,065 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:10:25,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:25,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:10:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 79. [2019-08-05 11:10:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:25,067 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:25,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:25,067 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:25,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:25,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:25,068 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:25,068 INFO L418 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1677766644, now seen corresponding path program 195 times [2019-08-05 11:10:25,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:25,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:25,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:25,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:25,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:25,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:25,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:25,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:25,183 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:25,309 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2019-08-05 11:10:25,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:25,309 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:25,310 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:10:25,310 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:10:25,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:10:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 75. [2019-08-05 11:10:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:25,313 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:25,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:25,313 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:25,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:25,313 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:25,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:25,313 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1] [2019-08-05 11:10:25,314 INFO L418 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:25,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:25,314 INFO L82 PathProgramCache]: Analyzing trace with hash -357972372, now seen corresponding path program 7 times [2019-08-05 11:10:25,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:25,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:25,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-08-05 11:10:25,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:25,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:25,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:25,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:25,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:25,403 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:25,445 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2019-08-05 11:10:25,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:25,446 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:25,446 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:10:25,446 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:10:25,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:25,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:10:25,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-08-05 11:10:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:25,449 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 54 [2019-08-05 11:10:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:25,449 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:25,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:25,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:25,450 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:25,450 INFO L418 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:25,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:25,450 INFO L82 PathProgramCache]: Analyzing trace with hash -784791436, now seen corresponding path program 196 times [2019-08-05 11:10:25,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:25,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:25,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:25,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:25,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:25,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:25,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:25,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:25,532 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 17 states. [2019-08-05 11:10:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:25,581 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2019-08-05 11:10:25,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:25,581 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:25,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:25,582 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:10:25,582 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:10:25,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:10:25,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 99. [2019-08-05 11:10:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:25,585 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 54 [2019-08-05 11:10:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:25,585 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:25,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:25,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:25,586 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:25,586 INFO L418 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:25,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:25,586 INFO L82 PathProgramCache]: Analyzing trace with hash 73108782, now seen corresponding path program 197 times [2019-08-05 11:10:25,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:25,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:25,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:10:25,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:25,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:25,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:25,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:25,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:25,695 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 17 states. [2019-08-05 11:10:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:25,747 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2019-08-05 11:10:25,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:25,747 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:25,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:25,748 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:10:25,748 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:10:25,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:10:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 95. [2019-08-05 11:10:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:25,751 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 54 [2019-08-05 11:10:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:25,751 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:25,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:25,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:25,752 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:25,752 INFO L418 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:25,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:25,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1759300434, now seen corresponding path program 198 times [2019-08-05 11:10:25,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:25,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:25,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:10:25,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:25,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:25,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:25,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:25,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:25,843 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 17 states. [2019-08-05 11:10:25,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:25,897 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2019-08-05 11:10:25,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:25,897 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:25,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:25,898 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:10:25,898 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:10:25,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:25,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:10:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2019-08-05 11:10:25,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:25,901 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 54 [2019-08-05 11:10:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:25,901 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:25,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:25,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:25,902 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:25,902 INFO L418 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:25,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:25,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1215872590, now seen corresponding path program 199 times [2019-08-05 11:10:25,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:25,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:25,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:25,980 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:25,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:25,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:25,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:25,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:25,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:25,982 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 17 states. [2019-08-05 11:10:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:26,064 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2019-08-05 11:10:26,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:26,065 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:26,065 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:10:26,066 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:10:26,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:26,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:10:26,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 91. [2019-08-05 11:10:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:26,069 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 54 [2019-08-05 11:10:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:26,069 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:26,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:26,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:26,070 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:26,070 INFO L418 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:26,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:26,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1328219280, now seen corresponding path program 200 times [2019-08-05 11:10:26,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:26,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:26,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:26,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:26,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:26,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:26,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:26,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:26,154 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 17 states. [2019-08-05 11:10:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:26,202 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2019-08-05 11:10:26,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:26,203 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:26,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:26,204 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:10:26,204 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:10:26,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:10:26,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 83. [2019-08-05 11:10:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:26,207 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 54 [2019-08-05 11:10:26,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:26,207 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:26,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:26,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:26,207 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:26,208 INFO L418 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:26,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1839973586, now seen corresponding path program 201 times [2019-08-05 11:10:26,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:26,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:26,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:10:26,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:26,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:26,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:26,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:26,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:26,295 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 17 states. [2019-08-05 11:10:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:26,339 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2019-08-05 11:10:26,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:26,339 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:26,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:26,340 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:10:26,340 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:10:26,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:10:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 91. [2019-08-05 11:10:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:26,343 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 54 [2019-08-05 11:10:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:26,343 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:26,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:26,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:26,344 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:26,344 INFO L418 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1408892432, now seen corresponding path program 202 times [2019-08-05 11:10:26,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:26,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:26,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:26,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:26,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:26,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:26,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:26,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:26,466 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 17 states. [2019-08-05 11:10:26,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:26,517 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2019-08-05 11:10:26,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:26,517 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:26,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:26,518 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:10:26,518 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:10:26,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:26,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:10:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 87. [2019-08-05 11:10:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:26,521 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 54 [2019-08-05 11:10:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:26,521 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:26,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:26,522 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:26,522 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:26,522 INFO L418 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash -704118284, now seen corresponding path program 203 times [2019-08-05 11:10:26,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:26,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:26,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:26,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:26,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:26,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:26,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:26,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:26,613 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 17 states. [2019-08-05 11:10:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:26,664 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2019-08-05 11:10:26,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:26,664 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:26,665 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:10:26,665 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:10:26,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:26,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:10:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 95. [2019-08-05 11:10:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:26,668 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 54 [2019-08-05 11:10:26,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:26,669 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:26,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:26,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:26,669 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:26,669 INFO L418 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:26,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:26,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1053665648, now seen corresponding path program 204 times [2019-08-05 11:10:26,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:26,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:26,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:26,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:26,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:26,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:26,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:26,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:26,756 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 17 states. [2019-08-05 11:10:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:26,813 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2019-08-05 11:10:26,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:26,813 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:26,814 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:10:26,814 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:10:26,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:10:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 99. [2019-08-05 11:10:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:26,818 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 54 [2019-08-05 11:10:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:26,818 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:26,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:26,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:26,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:26,819 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:26,819 INFO L418 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:26,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:26,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1484746802, now seen corresponding path program 205 times [2019-08-05 11:10:26,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:26,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:26,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:27,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:27,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:27,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:27,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:27,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:27,295 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 17 states. [2019-08-05 11:10:27,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:27,351 INFO L93 Difference]: Finished difference Result 141 states and 174 transitions. [2019-08-05 11:10:27,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:27,351 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:27,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:27,352 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:10:27,352 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:10:27,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:10:27,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 87. [2019-08-05 11:10:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:27,355 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 54 [2019-08-05 11:10:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:27,355 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:27,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:27,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:27,355 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:27,356 INFO L418 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:27,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:27,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1135199438, now seen corresponding path program 206 times [2019-08-05 11:10:27,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:27,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:27,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:27,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:27,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:27,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:27,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:27,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:27,446 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 17 states. [2019-08-05 11:10:27,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:27,498 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2019-08-05 11:10:27,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:27,499 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:27,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:27,499 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:10:27,499 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:10:27,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:10:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 83. [2019-08-05 11:10:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:27,502 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 54 [2019-08-05 11:10:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:27,502 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:27,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:27,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:27,503 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:27,503 INFO L418 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:27,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:27,503 INFO L82 PathProgramCache]: Analyzing trace with hash 697209778, now seen corresponding path program 207 times [2019-08-05 11:10:27,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:27,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:27,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:27,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:27,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:27,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:27,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:27,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:27,599 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 17 states. [2019-08-05 11:10:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:27,656 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:27,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:27,656 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:27,657 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:27,657 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:27,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 87. [2019-08-05 11:10:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:27,660 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 54 [2019-08-05 11:10:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:27,661 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:27,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:27,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:27,661 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:27,661 INFO L418 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:27,662 INFO L82 PathProgramCache]: Analyzing trace with hash 266128624, now seen corresponding path program 208 times [2019-08-05 11:10:27,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:27,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:27,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:27,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:27,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:27,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:27,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:27,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:27,747 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 17 states. [2019-08-05 11:10:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:27,802 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2019-08-05 11:10:27,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:27,802 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:27,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:27,803 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:10:27,803 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:10:27,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:10:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 75. [2019-08-05 11:10:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:27,807 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:27,807 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:27,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:27,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:27,808 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:27,808 INFO L418 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:27,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:27,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1151007348, now seen corresponding path program 209 times [2019-08-05 11:10:27,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:27,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:27,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:27,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:27,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:27,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:27,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:27,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:27,915 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:27,967 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:27,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:27,967 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:27,968 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:27,968 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:27,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:27,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:27,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 87. [2019-08-05 11:10:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:27,971 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 54 [2019-08-05 11:10:27,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:27,971 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:27,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:27,971 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:27,972 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:27,972 INFO L418 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:27,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:27,972 INFO L82 PathProgramCache]: Analyzing trace with hash 719926194, now seen corresponding path program 210 times [2019-08-05 11:10:27,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:27,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:27,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:28,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:28,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:28,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:28,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:28,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:28,063 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 17 states. [2019-08-05 11:10:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:28,113 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:28,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:28,114 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:28,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:28,115 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:28,115 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:28,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 83. [2019-08-05 11:10:28,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:28,118 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 54 [2019-08-05 11:10:28,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:28,118 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:28,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:28,118 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:28,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:28,118 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:28,119 INFO L418 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:28,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:28,119 INFO L82 PathProgramCache]: Analyzing trace with hash 599868078, now seen corresponding path program 211 times [2019-08-05 11:10:28,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:28,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:28,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:10:28,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:28,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:28,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:28,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:28,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:28,206 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 17 states. [2019-08-05 11:10:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:28,257 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2019-08-05 11:10:28,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:28,258 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:28,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:28,259 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:10:28,259 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:10:28,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:28,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:10:28,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 95. [2019-08-05 11:10:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:28,262 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 54 [2019-08-05 11:10:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:28,262 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:28,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:28,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:28,263 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:28,263 INFO L418 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:28,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:28,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1742631886, now seen corresponding path program 212 times [2019-08-05 11:10:28,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:28,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:28,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:28,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:28,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:28,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:28,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:28,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:28,350 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 17 states. [2019-08-05 11:10:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:28,405 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2019-08-05 11:10:28,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:28,405 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:28,406 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:10:28,406 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:10:28,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:28,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:10:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 99. [2019-08-05 11:10:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:28,409 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 54 [2019-08-05 11:10:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:28,409 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:28,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:28,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:28,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:28,410 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:28,410 INFO L418 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:28,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:28,410 INFO L82 PathProgramCache]: Analyzing trace with hash 2121254256, now seen corresponding path program 213 times [2019-08-05 11:10:28,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:28,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:28,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:28,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:28,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:28,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:28,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:28,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:28,509 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 17 states. [2019-08-05 11:10:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:28,563 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2019-08-05 11:10:28,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:28,564 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:28,565 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:10:28,565 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:10:28,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:28,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:10:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 91. [2019-08-05 11:10:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:28,568 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 54 [2019-08-05 11:10:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:28,568 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:28,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:28,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:28,569 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:28,569 INFO L418 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:28,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1661958734, now seen corresponding path program 214 times [2019-08-05 11:10:28,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:28,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:28,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:28,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:28,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:28,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:28,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:28,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:28,663 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 17 states. [2019-08-05 11:10:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:28,720 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:28,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:28,720 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:28,721 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:28,721 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:28,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2019-08-05 11:10:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:28,725 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 54 [2019-08-05 11:10:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:28,725 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:28,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:28,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:28,726 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:28,726 INFO L418 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:28,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:28,726 INFO L82 PathProgramCache]: Analyzing trace with hash -2093039888, now seen corresponding path program 215 times [2019-08-05 11:10:28,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:28,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:28,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:28,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:28,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:28,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:28,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:28,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:28,861 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 17 states. [2019-08-05 11:10:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:28,912 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2019-08-05 11:10:28,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:28,913 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:28,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:28,913 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:10:28,914 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:10:28,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:28,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:10:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 95. [2019-08-05 11:10:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:28,916 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 54 [2019-08-05 11:10:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:28,917 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:28,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:28,917 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:28,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:28,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:28,917 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:28,917 INFO L418 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:28,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:28,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1030949232, now seen corresponding path program 216 times [2019-08-05 11:10:28,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:28,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:28,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:29,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:29,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:29,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:29,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:29,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:29,017 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 17 states. [2019-08-05 11:10:29,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:29,069 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2019-08-05 11:10:29,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:29,069 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:29,070 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:10:29,070 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:10:29,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:10:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 91. [2019-08-05 11:10:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:29,073 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 54 [2019-08-05 11:10:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:29,073 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:29,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:29,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:29,074 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:29,074 INFO L418 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:29,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:29,074 INFO L82 PathProgramCache]: Analyzing trace with hash -801459984, now seen corresponding path program 217 times [2019-08-05 11:10:29,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:29,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:29,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:29,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:29,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:29,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:29,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:29,170 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 17 states. [2019-08-05 11:10:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:29,214 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2019-08-05 11:10:29,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:29,214 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:29,215 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:10:29,215 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:10:29,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:10:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 95. [2019-08-05 11:10:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:29,218 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 54 [2019-08-05 11:10:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:29,219 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:29,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:29,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:29,219 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:29,219 INFO L418 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:29,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:29,220 INFO L82 PathProgramCache]: Analyzing trace with hash -370378830, now seen corresponding path program 218 times [2019-08-05 11:10:29,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:29,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:29,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:29,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:29,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:29,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:29,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:29,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:29,310 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 17 states. [2019-08-05 11:10:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:29,358 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2019-08-05 11:10:29,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:29,359 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:29,359 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:10:29,360 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:10:29,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:10:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 87. [2019-08-05 11:10:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:29,364 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 54 [2019-08-05 11:10:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:29,364 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:29,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:29,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:29,365 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:29,365 INFO L418 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:29,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:29,366 INFO L82 PathProgramCache]: Analyzing trace with hash -882133136, now seen corresponding path program 219 times [2019-08-05 11:10:29,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:29,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:29,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:29,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:29,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:29,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:29,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:29,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:29,657 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 17 states. [2019-08-05 11:10:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:29,704 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2019-08-05 11:10:29,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:29,704 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:29,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:29,705 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:10:29,705 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:10:29,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:10:29,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 95. [2019-08-05 11:10:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:29,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:29,708 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 54 [2019-08-05 11:10:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:29,708 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:29,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:29,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:29,709 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:29,709 INFO L418 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:29,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:29,709 INFO L82 PathProgramCache]: Analyzing trace with hash -260630672, now seen corresponding path program 220 times [2019-08-05 11:10:29,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:29,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:29,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:29,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:29,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:29,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:29,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:29,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:29,798 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 17 states. [2019-08-05 11:10:29,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:29,847 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2019-08-05 11:10:29,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:29,848 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:29,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:29,849 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:10:29,849 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:10:29,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:29,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:10:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 99. [2019-08-05 11:10:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:29,852 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 54 [2019-08-05 11:10:29,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:29,852 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:29,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:29,853 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:29,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:29,853 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:29,853 INFO L418 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:29,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:29,853 INFO L82 PathProgramCache]: Analyzing trace with hash -451051982, now seen corresponding path program 221 times [2019-08-05 11:10:29,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:29,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:29,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:29,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:29,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:29,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:29,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:29,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:29,940 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 17 states. [2019-08-05 11:10:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:29,996 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2019-08-05 11:10:29,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:29,996 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:29,997 INFO L225 Difference]: With dead ends: 151 [2019-08-05 11:10:29,997 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 11:10:29,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 11:10:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 95. [2019-08-05 11:10:30,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:30,000 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 54 [2019-08-05 11:10:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:30,001 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:30,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:30,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:30,001 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:30,001 INFO L418 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:30,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:30,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2011506098, now seen corresponding path program 222 times [2019-08-05 11:10:30,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:30,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:30,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:30,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:30,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:30,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:30,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:30,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:30,087 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 17 states. [2019-08-05 11:10:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:30,140 INFO L93 Difference]: Finished difference Result 149 states and 184 transitions. [2019-08-05 11:10:30,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:30,141 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:30,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:30,142 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:10:30,142 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:10:30,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:10:30,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 99. [2019-08-05 11:10:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:30,145 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 54 [2019-08-05 11:10:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:30,145 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:30,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:30,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:30,146 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:30,146 INFO L418 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash -691711826, now seen corresponding path program 223 times [2019-08-05 11:10:30,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:30,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:30,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:10:30,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:30,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:30,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:30,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:30,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:30,241 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 17 states. [2019-08-05 11:10:30,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:30,287 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2019-08-05 11:10:30,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:30,288 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:30,288 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:30,289 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:30,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:30,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 79. [2019-08-05 11:10:30,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:30,291 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:30,292 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:30,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:30,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:30,292 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:30,292 INFO L418 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:30,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1852380044, now seen corresponding path program 224 times [2019-08-05 11:10:30,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:30,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:30,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:30,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:30,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:30,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:30,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:30,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:30,381 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:30,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:30,427 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2019-08-05 11:10:30,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:30,428 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:30,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:30,428 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:10:30,428 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:10:30,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:10:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 63. [2019-08-05 11:10:30,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:10:30,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2019-08-05 11:10:30,432 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 54 [2019-08-05 11:10:30,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:30,432 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2019-08-05 11:10:30,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2019-08-05 11:10:30,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:30,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:30,432 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:30,433 INFO L418 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:30,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:30,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1540886326, now seen corresponding path program 225 times [2019-08-05 11:10:30,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:30,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:30,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:30,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:30,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:30,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:30,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:30,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:30,535 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand 17 states. [2019-08-05 11:10:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:30,585 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2019-08-05 11:10:30,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:30,585 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:30,586 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:10:30,586 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:10:30,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:10:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 79. [2019-08-05 11:10:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:30,589 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:30,590 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:30,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:30,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:30,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:30,590 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:30,590 INFO L418 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:30,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:30,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1109805172, now seen corresponding path program 226 times [2019-08-05 11:10:30,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:30,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:30,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:30,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:30,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:30,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:30,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:30,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:30,681 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:30,734 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2019-08-05 11:10:30,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:30,734 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:30,735 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:10:30,735 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:10:30,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:30,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:10:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 75. [2019-08-05 11:10:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:30,739 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:30,739 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:30,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:30,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:30,740 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:30,740 INFO L418 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:30,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:30,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1352752908, now seen corresponding path program 227 times [2019-08-05 11:10:30,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:30,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:30,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:30,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:30,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:30,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:30,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:30,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:30,868 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:30,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:30,922 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2019-08-05 11:10:30,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:30,923 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:30,923 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:10:30,924 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:10:30,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:10:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 79. [2019-08-05 11:10:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:30,927 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:30,927 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:30,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:30,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:30,928 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:30,928 INFO L418 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:30,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:30,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1783834062, now seen corresponding path program 228 times [2019-08-05 11:10:30,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:30,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:30,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:31,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:31,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:31,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:31,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:31,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:31,016 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:31,064 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2019-08-05 11:10:31,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:31,065 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:31,066 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:10:31,066 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:10:31,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:10:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 71. [2019-08-05 11:10:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:10:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2019-08-05 11:10:31,070 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 54 [2019-08-05 11:10:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:31,070 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2019-08-05 11:10:31,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2019-08-05 11:10:31,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:31,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:31,070 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:31,070 INFO L418 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:31,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:31,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1259673298, now seen corresponding path program 229 times [2019-08-05 11:10:31,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:31,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:31,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:31,162 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:10:31,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:31,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:31,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:31,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:31,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:31,163 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand 17 states. [2019-08-05 11:10:31,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:31,206 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2019-08-05 11:10:31,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:31,206 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:31,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:31,207 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:31,207 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:31,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 83. [2019-08-05 11:10:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:31,209 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 54 [2019-08-05 11:10:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:31,210 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:31,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:31,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:31,210 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:31,210 INFO L418 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:31,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:31,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1272079756, now seen corresponding path program 230 times [2019-08-05 11:10:31,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:31,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:31,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:31,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:31,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:31,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:31,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:31,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:31,378 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 17 states. [2019-08-05 11:10:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:31,431 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2019-08-05 11:10:31,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:31,432 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:31,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:31,432 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:10:31,433 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:10:31,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:31,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:10:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 91. [2019-08-05 11:10:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:31,436 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 54 [2019-08-05 11:10:31,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:31,436 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:31,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:31,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:31,437 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:31,437 INFO L418 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:31,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:31,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1703160910, now seen corresponding path program 231 times [2019-08-05 11:10:31,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:31,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:31,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:31,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:31,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:31,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:31,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:31,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:31,540 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 17 states. [2019-08-05 11:10:31,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:31,598 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2019-08-05 11:10:31,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:31,599 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:31,599 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:10:31,599 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:10:31,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:31,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:10:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 87. [2019-08-05 11:10:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:31,602 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 54 [2019-08-05 11:10:31,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:31,602 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:31,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:31,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:31,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:31,603 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:31,603 INFO L418 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:31,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:31,603 INFO L82 PathProgramCache]: Analyzing trace with hash -828592144, now seen corresponding path program 232 times [2019-08-05 11:10:31,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:31,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:31,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:31,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:31,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:31,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:31,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:31,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:31,691 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 17 states. [2019-08-05 11:10:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:31,746 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2019-08-05 11:10:31,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:31,746 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:31,747 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:10:31,747 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:10:31,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:31,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:10:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 83. [2019-08-05 11:10:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:31,750 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 54 [2019-08-05 11:10:31,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:31,750 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:31,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:31,751 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:31,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:31,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:31,751 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:31,751 INFO L418 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:31,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:31,751 INFO L82 PathProgramCache]: Analyzing trace with hash 129248306, now seen corresponding path program 233 times [2019-08-05 11:10:31,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:31,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:31,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:31,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:31,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:31,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:31,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:31,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:31,841 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 17 states. [2019-08-05 11:10:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:31,893 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2019-08-05 11:10:31,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:31,893 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:31,894 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:10:31,894 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:10:31,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:10:31,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 87. [2019-08-05 11:10:31,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:31,897 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 54 [2019-08-05 11:10:31,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:31,897 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:31,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:31,897 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:31,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:31,898 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:31,898 INFO L418 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:31,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:31,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1633965936, now seen corresponding path program 234 times [2019-08-05 11:10:31,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:31,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:31,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:31,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:31,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:31,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:31,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:31,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:31,999 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 17 states. [2019-08-05 11:10:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:32,064 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2019-08-05 11:10:32,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:32,065 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:32,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:32,065 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:10:32,066 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:10:32,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:32,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:10:32,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 91. [2019-08-05 11:10:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:32,069 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 54 [2019-08-05 11:10:32,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:32,069 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:32,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:32,069 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:32,069 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:32,070 INFO L418 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:32,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:32,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2065047090, now seen corresponding path program 235 times [2019-08-05 11:10:32,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:32,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:32,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:32,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:32,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:32,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:32,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:32,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:32,360 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 17 states. [2019-08-05 11:10:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:32,434 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2019-08-05 11:10:32,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:32,434 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:32,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:32,435 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:10:32,435 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:10:32,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:32,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:10:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 83. [2019-08-05 11:10:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:32,437 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 54 [2019-08-05 11:10:32,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:32,437 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:32,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:32,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:32,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:32,438 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:32,438 INFO L418 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:32,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:32,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1553292784, now seen corresponding path program 236 times [2019-08-05 11:10:32,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:32,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:32,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:32,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:32,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:32,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:32,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:32,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:32,523 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 17 states. [2019-08-05 11:10:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:32,580 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2019-08-05 11:10:32,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:32,580 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:32,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:32,581 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:10:32,581 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:10:32,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:10:32,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 91. [2019-08-05 11:10:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:32,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:32,584 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 54 [2019-08-05 11:10:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:32,584 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:32,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:32,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:32,585 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:32,585 INFO L418 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:32,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:32,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1984373938, now seen corresponding path program 237 times [2019-08-05 11:10:32,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:32,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:32,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:32,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:32,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:32,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:32,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:32,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:32,672 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 17 states. [2019-08-05 11:10:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:32,727 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:32,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:32,728 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:32,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:32,728 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:32,729 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:32,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 87. [2019-08-05 11:10:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:32,731 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 54 [2019-08-05 11:10:32,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:32,731 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:32,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:32,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:32,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:32,732 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:32,732 INFO L418 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:32,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:32,732 INFO L82 PathProgramCache]: Analyzing trace with hash -301832848, now seen corresponding path program 238 times [2019-08-05 11:10:32,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:32,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:32,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:10:32,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:32,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:32,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:32,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:32,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:32,817 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 17 states. [2019-08-05 11:10:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:32,870 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-08-05 11:10:32,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:32,870 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:32,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:32,871 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:10:32,871 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:10:32,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:10:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 75. [2019-08-05 11:10:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:32,874 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 54 [2019-08-05 11:10:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:32,874 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:32,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:32,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:32,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:32,875 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:32,875 INFO L418 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:32,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash 583045876, now seen corresponding path program 239 times [2019-08-05 11:10:32,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:32,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:32,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:33,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:33,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:33,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:33,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:33,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:33,000 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 17 states. [2019-08-05 11:10:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:33,057 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2019-08-05 11:10:33,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:33,058 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:33,058 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:10:33,058 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:10:33,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:33,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:10:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 79. [2019-08-05 11:10:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:33,061 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 54 [2019-08-05 11:10:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:33,062 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:33,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:33,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:33,062 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:33,062 INFO L418 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:33,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:33,063 INFO L82 PathProgramCache]: Analyzing trace with hash 151964722, now seen corresponding path program 240 times [2019-08-05 11:10:33,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:33,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:33,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:10:33,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:33,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:33,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:33,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:33,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:33,168 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-08-05 11:10:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:33,225 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2019-08-05 11:10:33,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:33,226 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-08-05 11:10:33,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:33,226 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:10:33,227 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:10:33,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:10:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 57. [2019-08-05 11:10:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:10:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2019-08-05 11:10:33,229 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 54 [2019-08-05 11:10:33,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:33,230 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2019-08-05 11:10:33,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2019-08-05 11:10:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:33,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:33,230 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:33,231 INFO L418 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:33,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1957058368, now seen corresponding path program 241 times [2019-08-05 11:10:33,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:33,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:33,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:10:33,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:33,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:33,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:33,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:33,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:33,386 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 19 states. [2019-08-05 11:10:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:33,444 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2019-08-05 11:10:33,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:33,445 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:33,446 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:10:33,446 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:10:33,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:33,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:10:33,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 83. [2019-08-05 11:10:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:33,450 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 61 [2019-08-05 11:10:33,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:33,450 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:33,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:33,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:33,451 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:33,451 INFO L418 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:33,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:33,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1284315138, now seen corresponding path program 242 times [2019-08-05 11:10:33,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:33,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:33,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:33,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:33,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:33,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:33,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:33,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:33,569 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 19 states. [2019-08-05 11:10:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:33,626 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2019-08-05 11:10:33,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:33,627 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:33,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:33,628 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:10:33,628 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:10:33,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:33,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:10:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 79. [2019-08-05 11:10:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:33,631 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 61 [2019-08-05 11:10:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:33,631 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:33,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:33,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:33,632 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:33,632 INFO L418 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1432764034, now seen corresponding path program 243 times [2019-08-05 11:10:33,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:33,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:33,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:33,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:33,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:33,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:33,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:33,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:33,752 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 19 states. [2019-08-05 11:10:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:33,814 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2019-08-05 11:10:33,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:33,814 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:33,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:33,815 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:10:33,815 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:10:33,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:33,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:10:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 83. [2019-08-05 11:10:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:33,818 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 61 [2019-08-05 11:10:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:33,818 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:33,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:33,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:33,819 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:33,819 INFO L418 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:33,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:33,819 INFO L82 PathProgramCache]: Analyzing trace with hash 379170244, now seen corresponding path program 244 times [2019-08-05 11:10:33,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:33,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:33,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:33,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:33,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:33,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:33,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:33,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:33,951 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 19 states. [2019-08-05 11:10:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:34,012 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2019-08-05 11:10:34,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:34,012 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:34,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:34,013 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:10:34,013 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:10:34,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:10:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 75. [2019-08-05 11:10:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:34,016 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 61 [2019-08-05 11:10:34,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:34,016 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:34,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:34,017 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:34,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:34,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:34,017 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1] [2019-08-05 11:10:34,017 INFO L418 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:34,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:34,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2069792014, now seen corresponding path program 8 times [2019-08-05 11:10:34,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:34,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:34,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 11:10:34,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:34,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:34,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:34,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:34,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:34,134 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 19 states. [2019-08-05 11:10:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:34,177 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2019-08-05 11:10:34,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:34,177 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:34,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:34,178 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:10:34,178 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:10:34,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:10:34,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-08-05 11:10:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:34,180 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:34,180 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:34,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:34,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:34,181 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:34,181 INFO L418 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:34,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:34,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1695426050, now seen corresponding path program 245 times [2019-08-05 11:10:34,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:34,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:34,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:34,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:34,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:34,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:34,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:34,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:34,298 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:35,053 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2019-08-05 11:10:35,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:35,054 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:35,055 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:10:35,055 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:10:35,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:10:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 107. [2019-08-05 11:10:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:35,061 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:35,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:35,061 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:35,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:35,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:35,063 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:35,063 INFO L418 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:35,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:35,063 INFO L82 PathProgramCache]: Analyzing trace with hash 641832260, now seen corresponding path program 246 times [2019-08-05 11:10:35,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:35,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:35,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:35,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:35,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:35,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:35,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:35,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:35,275 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:35,336 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2019-08-05 11:10:35,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:35,337 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:35,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:35,338 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:10:35,338 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:10:35,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:35,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:10:35,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 103. [2019-08-05 11:10:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:35,340 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:35,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:35,341 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:35,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:35,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:35,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:35,341 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:35,341 INFO L418 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:35,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:35,341 INFO L82 PathProgramCache]: Analyzing trace with hash 790281156, now seen corresponding path program 247 times [2019-08-05 11:10:35,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:35,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:35,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:35,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:35,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:35,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:35,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:35,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:35,447 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:35,508 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2019-08-05 11:10:35,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:35,509 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:35,510 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:10:35,510 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:10:35,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:35,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:10:35,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 107. [2019-08-05 11:10:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:35,513 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:35,513 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:35,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:35,513 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:35,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:35,514 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:35,514 INFO L418 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:35,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:35,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1171581492, now seen corresponding path program 248 times [2019-08-05 11:10:35,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:35,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:35,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:10:35,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:35,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:35,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:35,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:35,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:35,621 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:35,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:35,685 INFO L93 Difference]: Finished difference Result 131 states and 161 transitions. [2019-08-05 11:10:35,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:35,685 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:35,686 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:10:35,686 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:10:35,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:35,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:10:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2019-08-05 11:10:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:35,689 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:35,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:35,689 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:35,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:35,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:35,690 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:35,690 INFO L418 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:35,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:35,690 INFO L82 PathProgramCache]: Analyzing trace with hash -263312634, now seen corresponding path program 249 times [2019-08-05 11:10:35,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:35,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:35,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:36,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:36,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:36,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:36,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:36,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:36,201 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:36,260 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2019-08-05 11:10:36,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:36,261 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:36,262 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:10:36,262 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:10:36,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:36,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:10:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 91. [2019-08-05 11:10:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:36,265 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:36,265 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:36,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:36,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:36,266 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:36,266 INFO L418 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:36,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1151865726, now seen corresponding path program 250 times [2019-08-05 11:10:36,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:36,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:36,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:36,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:36,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:36,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:36,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:36,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:36,370 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:36,422 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2019-08-05 11:10:36,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:36,423 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:36,423 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:10:36,424 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:10:36,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:36,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:10:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 103. [2019-08-05 11:10:36,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:36,427 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:36,427 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:36,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:36,427 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:36,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:36,427 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:36,428 INFO L418 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:36,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:36,428 INFO L82 PathProgramCache]: Analyzing trace with hash 2089507780, now seen corresponding path program 251 times [2019-08-05 11:10:36,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:36,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:36,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:36,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:36,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:36,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:36,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:36,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:36,532 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:36,595 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2019-08-05 11:10:36,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:36,595 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:36,596 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:10:36,596 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:10:36,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:36,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:10:36,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 99. [2019-08-05 11:10:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:36,599 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:36,599 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:36,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:36,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:36,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:36,600 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:36,600 INFO L418 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:36,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:36,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1320030388, now seen corresponding path program 252 times [2019-08-05 11:10:36,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:36,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:36,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:10:36,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:36,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:36,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:36,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:36,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:36,705 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:36,765 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2019-08-05 11:10:36,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:36,766 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:36,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:36,766 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:10:36,767 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:10:36,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:10:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 103. [2019-08-05 11:10:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:36,770 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:36,770 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:36,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:36,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:36,771 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:36,771 INFO L418 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:36,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:36,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2057010620, now seen corresponding path program 253 times [2019-08-05 11:10:36,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:36,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:36,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:36,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:36,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:36,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:36,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:36,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:36,923 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:36,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:36,983 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2019-08-05 11:10:36,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:36,984 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:36,985 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:36,985 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:36,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 107. [2019-08-05 11:10:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:36,988 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:36,989 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:36,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:36,989 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:36,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:36,989 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:36,989 INFO L418 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:36,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:36,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1184362886, now seen corresponding path program 254 times [2019-08-05 11:10:36,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:36,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:36,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:37,222 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:37,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:37,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:37,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:37,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:37,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:37,223 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:37,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:37,300 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2019-08-05 11:10:37,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:37,300 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:37,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:37,301 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:37,301 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:37,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:37,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:37,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 99. [2019-08-05 11:10:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:37,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:37,305 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:37,305 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:37,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:37,305 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:37,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:37,305 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:37,306 INFO L418 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:37,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:37,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1794348604, now seen corresponding path program 255 times [2019-08-05 11:10:37,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:37,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:37,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:37,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:37,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:37,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:37,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:37,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:37,570 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:37,632 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2019-08-05 11:10:37,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:37,633 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:37,634 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:37,634 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:37,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:37,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 107. [2019-08-05 11:10:37,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:37,637 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:37,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:37,638 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:37,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:37,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:37,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:37,638 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:37,638 INFO L418 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:37,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:37,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1447024902, now seen corresponding path program 256 times [2019-08-05 11:10:37,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:37,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:37,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:37,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:37,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:37,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:37,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:37,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:37,746 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:37,803 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2019-08-05 11:10:37,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:37,804 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:37,805 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:37,805 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:37,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:37,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 103. [2019-08-05 11:10:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:37,808 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:37,808 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:37,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:37,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:37,809 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:37,809 INFO L418 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:37,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:37,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1595473798, now seen corresponding path program 257 times [2019-08-05 11:10:37,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:37,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:37,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:37,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:37,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:37,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:37,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:37,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:37,923 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:37,984 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2019-08-05 11:10:37,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:37,985 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:37,986 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:10:37,986 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:10:37,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:37,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:10:37,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 107. [2019-08-05 11:10:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:37,989 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:37,989 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:37,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:37,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:37,990 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:37,990 INFO L418 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:37,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:37,990 INFO L82 PathProgramCache]: Analyzing trace with hash 541880008, now seen corresponding path program 258 times [2019-08-05 11:10:37,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:37,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:37,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:38,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:38,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:38,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:38,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:38,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:38,096 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:38,158 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2019-08-05 11:10:38,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:38,158 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:38,159 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:10:38,159 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:10:38,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:10:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 91. [2019-08-05 11:10:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:38,163 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:38,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:38,163 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:38,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:38,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:38,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:38,163 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:38,163 INFO L418 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:38,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:38,164 INFO L82 PathProgramCache]: Analyzing trace with hash 938816514, now seen corresponding path program 259 times [2019-08-05 11:10:38,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:38,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:38,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:38,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:38,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:38,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:38,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:38,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:38,273 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:38,332 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2019-08-05 11:10:38,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:38,332 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:38,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:38,333 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:10:38,333 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:10:38,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:38,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:10:38,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 107. [2019-08-05 11:10:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:38,336 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:38,336 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:38,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:38,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:38,337 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:38,337 INFO L418 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:38,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:38,337 INFO L82 PathProgramCache]: Analyzing trace with hash -114777276, now seen corresponding path program 260 times [2019-08-05 11:10:38,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:38,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:38,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:38,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:38,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:38,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:38,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:38,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:38,448 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:38,508 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2019-08-05 11:10:38,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:38,509 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:38,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:38,509 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:10:38,510 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:10:38,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:10:38,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 103. [2019-08-05 11:10:38,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:38,513 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:38,513 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:38,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:38,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:38,513 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:38,514 INFO L418 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:38,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:38,514 INFO L82 PathProgramCache]: Analyzing trace with hash -266436598, now seen corresponding path program 261 times [2019-08-05 11:10:38,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:38,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:38,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:38,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:38,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:38,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:38,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:38,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:38,649 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:38,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:38,707 INFO L93 Difference]: Finished difference Result 141 states and 174 transitions. [2019-08-05 11:10:38,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:38,707 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:38,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:38,708 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:10:38,708 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:10:38,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:10:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 95. [2019-08-05 11:10:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:38,712 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:38,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:38,712 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:38,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:38,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:38,712 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:38,712 INFO L418 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:38,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:38,713 INFO L82 PathProgramCache]: Analyzing trace with hash 33671620, now seen corresponding path program 262 times [2019-08-05 11:10:38,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:38,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:38,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:38,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:38,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:38,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:38,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:38,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:38,831 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:38,896 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2019-08-05 11:10:38,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:38,896 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:38,897 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:10:38,897 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:10:38,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:38,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:10:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 99. [2019-08-05 11:10:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:38,901 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:38,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:38,901 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:38,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:38,901 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:38,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:38,901 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:38,901 INFO L418 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:38,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:38,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1019922170, now seen corresponding path program 263 times [2019-08-05 11:10:38,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:38,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:38,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:39,017 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:39,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:39,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:39,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:39,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:39,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:39,018 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:39,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:39,175 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2019-08-05 11:10:39,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:39,175 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:39,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:39,176 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:10:39,176 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:10:39,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:39,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:10:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 91. [2019-08-05 11:10:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:39,179 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:39,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:39,179 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:39,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:39,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:39,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:39,180 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:39,180 INFO L418 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash 296333636, now seen corresponding path program 264 times [2019-08-05 11:10:39,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:39,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:39,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:39,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:39,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:39,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:39,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:39,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:39,283 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:39,338 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2019-08-05 11:10:39,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:39,338 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:39,339 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:10:39,339 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:10:39,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:10:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 99. [2019-08-05 11:10:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:39,342 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:39,342 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:39,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:39,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:39,343 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:39,343 INFO L418 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash -757260154, now seen corresponding path program 265 times [2019-08-05 11:10:39,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:39,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:39,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:39,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:39,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:39,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:39,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:39,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:39,449 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:39,505 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2019-08-05 11:10:39,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:39,506 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:39,507 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:10:39,507 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:10:39,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:39,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:10:39,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 95. [2019-08-05 11:10:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:39,510 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:39,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:39,511 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:39,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:39,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:39,511 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:39,511 INFO L418 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:39,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1582692404, now seen corresponding path program 266 times [2019-08-05 11:10:39,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:39,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:39,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:10:39,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:39,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:39,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:39,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:39,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:39,647 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:39,705 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2019-08-05 11:10:39,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:39,706 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:39,707 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:39,707 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:39,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 103. [2019-08-05 11:10:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:39,710 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:39,710 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:39,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:39,710 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:39,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:39,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:39,711 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:39,711 INFO L418 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:39,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:39,711 INFO L82 PathProgramCache]: Analyzing trace with hash -608811258, now seen corresponding path program 267 times [2019-08-05 11:10:39,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:39,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:39,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:39,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:39,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:39,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:39,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:39,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:39,819 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:39,877 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2019-08-05 11:10:39,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:39,878 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:39,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:39,879 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:39,879 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:39,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:39,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:39,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 107. [2019-08-05 11:10:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:39,882 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:39,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:39,882 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:39,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:39,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:39,883 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:39,883 INFO L418 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:39,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:39,883 INFO L82 PathProgramCache]: Analyzing trace with hash -529098614, now seen corresponding path program 268 times [2019-08-05 11:10:39,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:39,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:39,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:39,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:39,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:39,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:39,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:39,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:39,987 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:40,043 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2019-08-05 11:10:40,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:40,044 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:40,044 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:40,045 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:40,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 103. [2019-08-05 11:10:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:40,048 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:40,048 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:40,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:40,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:40,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:40,048 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:40,048 INFO L418 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:40,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:40,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1662405048, now seen corresponding path program 269 times [2019-08-05 11:10:40,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:40,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:40,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:40,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:40,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:40,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:40,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:40,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:40,154 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:40,211 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2019-08-05 11:10:40,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:40,212 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:40,212 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:10:40,212 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:10:40,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:10:40,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 91. [2019-08-05 11:10:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:40,216 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:40,216 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:40,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:40,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:40,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:40,217 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:40,217 INFO L418 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:40,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:40,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1744009156, now seen corresponding path program 270 times [2019-08-05 11:10:40,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:40,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:40,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:40,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:40,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:40,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:40,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:40,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:40,333 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:40,391 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2019-08-05 11:10:40,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:40,391 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:40,392 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:10:40,392 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:10:40,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:10:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 103. [2019-08-05 11:10:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:40,396 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:40,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:40,396 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:40,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:40,397 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:40,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:40,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:40,397 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:40,397 INFO L418 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:40,398 INFO L82 PathProgramCache]: Analyzing trace with hash -677547510, now seen corresponding path program 271 times [2019-08-05 11:10:40,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:40,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:40,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:40,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:40,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:40,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:40,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:40,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:40,509 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:40,589 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2019-08-05 11:10:40,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:40,589 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:40,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:40,590 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:40,590 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:40,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:40,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:40,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 107. [2019-08-05 11:10:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:40,593 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:40,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:40,593 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:40,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:40,593 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:40,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:40,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:40,594 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:40,594 INFO L418 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:40,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:40,594 INFO L82 PathProgramCache]: Analyzing trace with hash 690415366, now seen corresponding path program 272 times [2019-08-05 11:10:40,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:40,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:40,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:40,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:40,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:40,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:40,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:40,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:40,701 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:40,759 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2019-08-05 11:10:40,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:40,759 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:40,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:40,760 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:40,760 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:40,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 103. [2019-08-05 11:10:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:40,763 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:40,764 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:40,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:40,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:40,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:40,764 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:40,764 INFO L418 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:40,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:40,765 INFO L82 PathProgramCache]: Analyzing trace with hash 838864262, now seen corresponding path program 273 times [2019-08-05 11:10:40,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:40,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:40,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:40,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:40,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:40,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:40,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:40,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:40,874 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:41,056 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2019-08-05 11:10:41,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:41,056 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:41,057 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:41,057 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:41,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:41,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 107. [2019-08-05 11:10:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:41,060 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:41,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:41,061 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:41,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:41,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:41,061 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:41,061 INFO L418 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:41,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:41,062 INFO L82 PathProgramCache]: Analyzing trace with hash -214729528, now seen corresponding path program 274 times [2019-08-05 11:10:41,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:41,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:41,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:41,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:41,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:41,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:41,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:41,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:41,171 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:41,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:41,250 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2019-08-05 11:10:41,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:41,251 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:41,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:41,252 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:41,252 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:41,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:41,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 99. [2019-08-05 11:10:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:41,255 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:41,255 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:41,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:41,255 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:41,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:41,256 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:41,256 INFO L418 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:41,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:41,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1101526278, now seen corresponding path program 275 times [2019-08-05 11:10:41,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:41,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:41,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:41,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:41,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:41,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:41,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:41,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:41,362 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:41,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:41,424 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2019-08-05 11:10:41,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:41,424 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:41,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:41,425 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:41,425 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:41,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 107. [2019-08-05 11:10:41,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:41,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:41,429 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:41,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:41,429 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:41,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:41,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:41,429 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:41,429 INFO L418 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:41,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:41,430 INFO L82 PathProgramCache]: Analyzing trace with hash 47932488, now seen corresponding path program 276 times [2019-08-05 11:10:41,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:41,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:41,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:41,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:41,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:41,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:41,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:41,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:41,541 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:41,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:41,597 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2019-08-05 11:10:41,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:41,597 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:41,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:41,598 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:41,598 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:41,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:41,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:41,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 103. [2019-08-05 11:10:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:41,602 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:41,602 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:41,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:41,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:41,603 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:41,603 INFO L418 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:41,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:41,603 INFO L82 PathProgramCache]: Analyzing trace with hash 196381384, now seen corresponding path program 277 times [2019-08-05 11:10:41,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:41,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:41,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:41,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:41,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:41,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:41,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:41,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:41,713 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:41,772 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2019-08-05 11:10:41,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:41,772 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:41,773 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:10:41,773 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:10:41,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:41,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:10:41,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 107. [2019-08-05 11:10:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:41,776 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:41,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:41,776 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:41,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:41,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:41,777 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:41,777 INFO L418 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:41,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:41,777 INFO L82 PathProgramCache]: Analyzing trace with hash 376046280, now seen corresponding path program 278 times [2019-08-05 11:10:41,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:41,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:41,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:41,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:41,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:41,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:41,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:41,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:41,881 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:41,943 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2019-08-05 11:10:41,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:41,943 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:41,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:41,944 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:41,944 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:41,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:41,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 95. [2019-08-05 11:10:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:41,948 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:41,948 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:41,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:41,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:41,948 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:41,948 INFO L418 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:41,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:41,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1264599372, now seen corresponding path program 279 times [2019-08-05 11:10:41,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:41,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:41,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:10:42,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:42,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:42,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:42,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:42,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:42,069 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:42,120 INFO L93 Difference]: Finished difference Result 165 states and 204 transitions. [2019-08-05 11:10:42,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:42,120 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:42,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:42,121 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:10:42,121 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:10:42,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:42,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:10:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 107. [2019-08-05 11:10:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:42,124 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:42,125 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:42,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:42,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:42,125 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:42,125 INFO L418 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:42,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:42,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1976774134, now seen corresponding path program 280 times [2019-08-05 11:10:42,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:42,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:42,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:42,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:42,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:42,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:42,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:42,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:42,231 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:42,320 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2019-08-05 11:10:42,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:42,320 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:42,321 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:10:42,321 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:10:42,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:10:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 103. [2019-08-05 11:10:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:42,325 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:42,326 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:42,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:42,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:42,326 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:42,327 INFO L418 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:42,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:42,327 INFO L82 PathProgramCache]: Analyzing trace with hash -857212406, now seen corresponding path program 281 times [2019-08-05 11:10:42,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:42,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:42,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:42,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:42,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:42,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:42,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:42,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:42,687 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:42,752 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2019-08-05 11:10:42,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:42,753 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:42,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:42,753 INFO L225 Difference]: With dead ends: 151 [2019-08-05 11:10:42,754 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 11:10:42,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:42,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 11:10:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 83. [2019-08-05 11:10:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:42,757 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 61 [2019-08-05 11:10:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:42,757 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:42,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:42,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:42,758 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:42,758 INFO L418 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:42,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash 921148034, now seen corresponding path program 282 times [2019-08-05 11:10:42,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:42,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:42,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:42,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:42,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:42,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:42,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:42,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:42,865 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 19 states. [2019-08-05 11:10:42,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:42,922 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2019-08-05 11:10:42,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:42,923 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:42,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:42,923 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:10:42,924 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:10:42,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:42,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:10:42,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 103. [2019-08-05 11:10:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:42,927 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:42,927 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:42,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:42,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:42,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:42,927 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:42,928 INFO L418 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:42,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:42,928 INFO L82 PathProgramCache]: Analyzing trace with hash -132445756, now seen corresponding path program 283 times [2019-08-05 11:10:42,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:42,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:42,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:43,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:43,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:43,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:43,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:43,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:43,037 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:43,094 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2019-08-05 11:10:43,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:43,094 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:43,095 INFO L225 Difference]: With dead ends: 151 [2019-08-05 11:10:43,095 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 11:10:43,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:43,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 11:10:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 99. [2019-08-05 11:10:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:43,099 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:43,099 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:43,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:43,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:43,100 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:43,100 INFO L418 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash 16003140, now seen corresponding path program 284 times [2019-08-05 11:10:43,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:43,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:43,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:43,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:43,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:43,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:43,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:43,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:43,238 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:43,295 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2019-08-05 11:10:43,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:43,295 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:43,296 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:43,296 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:43,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:43,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:43,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 103. [2019-08-05 11:10:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:43,299 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:43,299 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:43,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:43,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:43,300 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:43,300 INFO L418 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:43,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:43,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1037590650, now seen corresponding path program 285 times [2019-08-05 11:10:43,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:43,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:43,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:43,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:43,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:43,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:43,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:43,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:43,434 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:43,489 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2019-08-05 11:10:43,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:43,489 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:43,490 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:10:43,490 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:10:43,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:10:43,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 95. [2019-08-05 11:10:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:43,493 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:43,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:43,493 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:43,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:43,493 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:43,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:43,494 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:43,494 INFO L418 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:43,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2125223030, now seen corresponding path program 286 times [2019-08-05 11:10:43,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:43,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:43,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:43,598 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:43,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:43,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:43,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:43,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:43,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:43,599 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:43,651 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2019-08-05 11:10:43,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:43,651 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:43,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:43,652 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:10:43,652 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:10:43,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:10:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 99. [2019-08-05 11:10:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:43,656 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:43,656 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:43,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:43,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:43,656 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:43,657 INFO L418 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:43,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:43,657 INFO L82 PathProgramCache]: Analyzing trace with hash 278665156, now seen corresponding path program 287 times [2019-08-05 11:10:43,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:43,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:43,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:43,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:43,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:43,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:43,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:43,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:43,764 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:43,822 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2019-08-05 11:10:43,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:43,823 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:43,823 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:43,823 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:43,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:43,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 107. [2019-08-05 11:10:43,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:43,826 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:43,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:43,826 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:43,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:43,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:43,827 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:43,827 INFO L418 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:43,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:43,827 INFO L82 PathProgramCache]: Analyzing trace with hash -774928634, now seen corresponding path program 288 times [2019-08-05 11:10:43,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:43,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:43,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:43,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:43,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:43,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:43,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:43,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:43,936 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:43,998 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2019-08-05 11:10:43,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:43,999 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:44,000 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:44,000 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:44,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 103. [2019-08-05 11:10:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:44,003 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:44,003 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:44,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:44,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:44,004 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:44,004 INFO L418 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:44,004 INFO L82 PathProgramCache]: Analyzing trace with hash -626479738, now seen corresponding path program 289 times [2019-08-05 11:10:44,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:44,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:44,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:44,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:44,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:44,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:44,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:44,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:44,118 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:44,178 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2019-08-05 11:10:44,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:44,179 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:44,180 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:44,180 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:44,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:44,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 107. [2019-08-05 11:10:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:44,183 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:44,183 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:44,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:44,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:44,184 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:44,184 INFO L418 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:44,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1071629240, now seen corresponding path program 290 times [2019-08-05 11:10:44,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:44,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:44,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:44,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:44,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:44,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:44,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:44,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:44,360 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:44,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:44,423 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2019-08-05 11:10:44,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:44,424 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:44,425 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:10:44,425 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:10:44,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:10:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 99. [2019-08-05 11:10:44,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:44,428 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:44,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:44,428 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:44,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:44,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:44,429 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:44,429 INFO L418 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:44,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1680073528, now seen corresponding path program 291 times [2019-08-05 11:10:44,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:44,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:44,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:44,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:44,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:44,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:44,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:44,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:44,537 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:44,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:44,680 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2019-08-05 11:10:44,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:44,681 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:44,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:44,682 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:10:44,682 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:10:44,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:10:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 87. [2019-08-05 11:10:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:44,685 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 61 [2019-08-05 11:10:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:44,685 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:44,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:44,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:44,686 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:44,686 INFO L418 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1726340676, now seen corresponding path program 292 times [2019-08-05 11:10:44,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:44,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:44,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:44,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:44,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:44,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:44,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:44,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:44,797 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 19 states. [2019-08-05 11:10:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:44,858 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2019-08-05 11:10:44,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:44,859 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:44,860 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:10:44,860 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:10:44,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:10:44,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 99. [2019-08-05 11:10:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:44,863 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:44,863 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:44,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:44,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:44,863 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:44,864 INFO L418 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:44,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:44,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1907082250, now seen corresponding path program 293 times [2019-08-05 11:10:44,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:44,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:44,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:44,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:44,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:44,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:44,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:44,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:44,969 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:45,022 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2019-08-05 11:10:45,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:45,023 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:45,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:45,024 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:10:45,024 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:10:45,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:10:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 107. [2019-08-05 11:10:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:45,027 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:45,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:45,028 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:45,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:45,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:45,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:45,028 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:45,028 INFO L418 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:45,029 INFO L82 PathProgramCache]: Analyzing trace with hash 672746886, now seen corresponding path program 294 times [2019-08-05 11:10:45,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:45,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:45,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:45,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:45,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:45,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:45,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:45,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:45,161 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:45,224 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2019-08-05 11:10:45,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:45,225 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:45,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:45,226 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:45,226 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:45,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 103. [2019-08-05 11:10:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:45,229 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:45,229 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:45,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:45,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:45,230 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:45,230 INFO L418 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:45,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash 821195782, now seen corresponding path program 295 times [2019-08-05 11:10:45,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:45,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:45,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:45,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:45,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:45,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:45,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:45,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:45,339 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:45,401 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2019-08-05 11:10:45,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:45,402 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:45,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:45,403 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:45,403 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:45,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:45,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 107. [2019-08-05 11:10:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:45,406 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:45,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:45,406 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:45,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:45,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:45,407 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:45,407 INFO L418 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:45,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:45,407 INFO L82 PathProgramCache]: Analyzing trace with hash -232398008, now seen corresponding path program 296 times [2019-08-05 11:10:45,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:45,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:45,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:45,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:45,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:45,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:45,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:45,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:45,554 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:45,618 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2019-08-05 11:10:45,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:45,619 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:45,619 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:45,620 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:45,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:45,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2019-08-05 11:10:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:45,623 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:45,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:45,623 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:45,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:45,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:45,624 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:45,624 INFO L418 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:45,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:45,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1083857798, now seen corresponding path program 297 times [2019-08-05 11:10:45,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:45,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:45,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:45,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:45,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:45,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:45,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:45,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:45,735 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:45,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:45,797 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2019-08-05 11:10:45,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:45,798 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:45,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:45,799 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:45,799 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:45,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:45,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 107. [2019-08-05 11:10:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:45,802 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:45,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:45,802 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:45,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:45,803 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:45,803 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:45,803 INFO L418 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:45,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:45,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1334291256, now seen corresponding path program 298 times [2019-08-05 11:10:45,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:45,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:45,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:45,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:45,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:45,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:45,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:45,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:45,909 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:45,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:45,970 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2019-08-05 11:10:45,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:45,971 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:45,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:45,972 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:10:45,972 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:10:45,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:10:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 103. [2019-08-05 11:10:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:45,975 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:45,975 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:45,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:45,975 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:45,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:45,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:45,976 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:45,976 INFO L418 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:45,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:45,976 INFO L82 PathProgramCache]: Analyzing trace with hash 30264008, now seen corresponding path program 299 times [2019-08-05 11:10:45,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:45,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:45,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:46,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:46,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:46,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:46,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:46,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:46,084 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:46,142 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2019-08-05 11:10:46,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:46,142 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:46,143 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:46,143 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:46,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:46,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 99. [2019-08-05 11:10:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:46,146 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:46,146 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:46,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:46,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:46,147 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:46,147 INFO L418 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:46,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:46,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1482740152, now seen corresponding path program 300 times [2019-08-05 11:10:46,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:46,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:46,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:46,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:46,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:46,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:46,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:46,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:46,267 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:46,323 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2019-08-05 11:10:46,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:46,324 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:46,325 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:46,325 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:46,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:46,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 103. [2019-08-05 11:10:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:46,328 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:46,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:46,328 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:46,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:46,328 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:46,329 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:46,329 INFO L418 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:46,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:46,329 INFO L82 PathProgramCache]: Analyzing trace with hash 178712904, now seen corresponding path program 301 times [2019-08-05 11:10:46,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:46,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:46,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:46,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:46,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:46,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:46,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:46,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:46,436 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:46,502 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2019-08-05 11:10:46,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:46,502 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:46,503 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:10:46,503 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:10:46,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:10:46,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 107. [2019-08-05 11:10:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:46,506 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:46,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:46,507 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:46,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:46,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:46,507 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:46,507 INFO L418 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:46,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:46,508 INFO L82 PathProgramCache]: Analyzing trace with hash -874880886, now seen corresponding path program 302 times [2019-08-05 11:10:46,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:46,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:46,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:46,963 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:46,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:46,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:46,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:46,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:46,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:46,964 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:47,143 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2019-08-05 11:10:47,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:47,144 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:47,145 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:10:47,145 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:10:47,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:10:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 91. [2019-08-05 11:10:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:47,148 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:47,148 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:47,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:47,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:47,149 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:47,149 INFO L418 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:47,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:47,149 INFO L82 PathProgramCache]: Analyzing trace with hash -477944380, now seen corresponding path program 303 times [2019-08-05 11:10:47,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:47,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:47,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:47,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:47,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:47,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:47,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:47,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:47,257 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:47,312 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2019-08-05 11:10:47,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:47,313 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:47,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:47,313 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:10:47,313 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:10:47,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:10:47,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 107. [2019-08-05 11:10:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:47,318 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:47,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:47,318 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:47,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:47,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:47,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:47,319 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:47,319 INFO L418 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:47,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:47,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1531538170, now seen corresponding path program 304 times [2019-08-05 11:10:47,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:47,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:47,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:47,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:47,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:47,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:47,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:47,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:47,799 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:47,866 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2019-08-05 11:10:47,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:47,866 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:47,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:47,867 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:10:47,867 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:10:47,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:10:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 103. [2019-08-05 11:10:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:47,872 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:47,872 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:47,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:47,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:47,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:47,872 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:47,872 INFO L418 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:47,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:47,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1383089274, now seen corresponding path program 305 times [2019-08-05 11:10:47,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:47,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:47,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:47,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:47,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:47,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:47,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:47,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:47,990 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:48,049 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2019-08-05 11:10:48,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:48,050 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:48,050 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:48,050 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:48,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:48,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 107. [2019-08-05 11:10:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:48,054 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:48,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:48,054 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:48,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:48,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:48,055 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:48,055 INFO L418 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:48,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:48,055 INFO L82 PathProgramCache]: Analyzing trace with hash -429146362, now seen corresponding path program 306 times [2019-08-05 11:10:48,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:48,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:48,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:48,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:48,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:48,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:48,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:48,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:48,162 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:48,220 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2019-08-05 11:10:48,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:48,220 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:48,221 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:48,221 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:48,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 91. [2019-08-05 11:10:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:48,224 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:48,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:48,225 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:48,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:48,225 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:48,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:48,225 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:48,225 INFO L418 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:48,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:48,226 INFO L82 PathProgramCache]: Analyzing trace with hash -826082868, now seen corresponding path program 307 times [2019-08-05 11:10:48,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:48,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:48,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:10:48,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:48,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:48,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:48,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:48,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:48,334 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:48,388 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2019-08-05 11:10:48,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:48,389 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:48,390 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:48,390 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:48,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 107. [2019-08-05 11:10:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:48,393 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:48,393 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:48,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:48,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:48,394 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:48,394 INFO L418 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:48,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:48,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1858284232, now seen corresponding path program 308 times [2019-08-05 11:10:48,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:48,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:48,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:48,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:48,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:48,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:48,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:48,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:48,500 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:48,557 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2019-08-05 11:10:48,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:48,557 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:48,558 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:48,558 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:48,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 99. [2019-08-05 11:10:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:48,561 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:48,561 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:48,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:48,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:48,562 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:48,562 INFO L418 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:48,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:48,562 INFO L82 PathProgramCache]: Analyzing trace with hash 227510922, now seen corresponding path program 309 times [2019-08-05 11:10:48,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:48,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:48,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:48,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:48,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:48,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:48,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:48,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:48,753 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:48,817 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2019-08-05 11:10:48,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:48,818 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:48,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:48,819 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:48,819 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:48,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:48,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 95. [2019-08-05 11:10:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:48,822 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:48,822 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:48,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:48,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:48,823 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:48,823 INFO L418 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:48,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:48,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1120427258, now seen corresponding path program 310 times [2019-08-05 11:10:48,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:48,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:48,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:48,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:48,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:48,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:48,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:48,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:48,932 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:49,031 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2019-08-05 11:10:49,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:49,031 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:49,032 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:49,032 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:49,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:49,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 103. [2019-08-05 11:10:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:49,035 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:49,036 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:49,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:49,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:49,036 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:49,036 INFO L418 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:49,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:49,037 INFO L82 PathProgramCache]: Analyzing trace with hash 79062026, now seen corresponding path program 311 times [2019-08-05 11:10:49,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:49,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:49,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:49,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:49,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:49,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:49,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:49,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:49,146 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:49,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:49,203 INFO L93 Difference]: Finished difference Result 171 states and 212 transitions. [2019-08-05 11:10:49,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:49,204 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:49,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:49,205 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:10:49,205 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:10:49,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:10:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 107. [2019-08-05 11:10:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:49,208 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:49,208 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:49,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:49,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:49,209 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:49,209 INFO L418 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:49,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:49,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2120946248, now seen corresponding path program 312 times [2019-08-05 11:10:49,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:49,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:49,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:49,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:49,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:49,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:49,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:49,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:49,317 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:49,378 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2019-08-05 11:10:49,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:49,379 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:49,379 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:49,380 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:49,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 103. [2019-08-05 11:10:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:49,384 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:49,384 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:49,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:49,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:49,385 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:49,385 INFO L418 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:49,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:49,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2025572152, now seen corresponding path program 313 times [2019-08-05 11:10:49,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:49,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:49,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:49,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:49,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:49,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:49,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:49,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:49,492 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:49,549 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2019-08-05 11:10:49,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:49,550 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:49,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:49,551 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:10:49,551 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:10:49,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:10:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 107. [2019-08-05 11:10:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:49,554 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:49,554 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:49,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:49,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:49,554 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:49,555 INFO L418 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:49,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1215801354, now seen corresponding path program 314 times [2019-08-05 11:10:49,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:49,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:49,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:49,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:49,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:49,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:49,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:49,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:49,662 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:49,717 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2019-08-05 11:10:49,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:49,718 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:49,718 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:10:49,718 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:10:49,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:49,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:10:49,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 95. [2019-08-05 11:10:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:49,722 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:49,722 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:49,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:49,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:49,722 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:49,723 INFO L418 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:49,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:49,723 INFO L82 PathProgramCache]: Analyzing trace with hash 327248262, now seen corresponding path program 315 times [2019-08-05 11:10:49,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:49,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:49,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:49,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:49,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:49,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:49,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:49,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:49,882 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:49,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:49,944 INFO L93 Difference]: Finished difference Result 167 states and 207 transitions. [2019-08-05 11:10:49,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:49,944 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:49,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:49,945 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:10:49,945 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:10:49,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:10:49,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 107. [2019-08-05 11:10:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:49,948 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:49,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:49,949 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:49,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:49,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:49,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:49,949 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:49,949 INFO L418 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:49,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:49,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1132655816, now seen corresponding path program 316 times [2019-08-05 11:10:49,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:49,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:49,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:50,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:50,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:50,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:50,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:50,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:50,095 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:50,156 INFO L93 Difference]: Finished difference Result 171 states and 212 transitions. [2019-08-05 11:10:50,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:50,156 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:50,157 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:10:50,157 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:10:50,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:10:50,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 99. [2019-08-05 11:10:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:50,160 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:50,161 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:50,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:50,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:50,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:50,161 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:50,161 INFO L418 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:50,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:50,162 INFO L82 PathProgramCache]: Analyzing trace with hash -726345528, now seen corresponding path program 317 times [2019-08-05 11:10:50,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:50,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:50,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:50,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:50,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:50,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:50,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:50,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:50,267 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:50,327 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2019-08-05 11:10:50,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:50,327 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:50,328 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:10:50,328 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:10:50,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:10:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 95. [2019-08-05 11:10:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:50,332 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:50,332 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:50,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:50,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:50,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:50,332 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:50,333 INFO L418 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:50,333 INFO L82 PathProgramCache]: Analyzing trace with hash -183599990, now seen corresponding path program 318 times [2019-08-05 11:10:50,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:50,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:50,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:50,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:50,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:50,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:50,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:50,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:50,443 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:50,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:50,498 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2019-08-05 11:10:50,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:50,498 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:50,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:50,499 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:10:50,499 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:10:50,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:10:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 103. [2019-08-05 11:10:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:50,503 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:50,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:50,504 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:50,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:50,505 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:50,505 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:50,505 INFO L418 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:50,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:50,505 INFO L82 PathProgramCache]: Analyzing trace with hash -577896632, now seen corresponding path program 319 times [2019-08-05 11:10:50,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:50,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:50,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:50,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:50,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:50,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:50,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:50,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:50,621 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:50,680 INFO L93 Difference]: Finished difference Result 167 states and 207 transitions. [2019-08-05 11:10:50,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:50,680 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:50,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:50,681 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:10:50,681 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:10:50,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:10:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 107. [2019-08-05 11:10:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:50,685 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:50,685 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:50,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:50,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:50,685 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:50,685 INFO L418 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:50,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:50,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1631490422, now seen corresponding path program 320 times [2019-08-05 11:10:50,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:50,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:50,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:50,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:50,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:50,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:50,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:50,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:50,790 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:50,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:50,937 INFO L93 Difference]: Finished difference Result 167 states and 207 transitions. [2019-08-05 11:10:50,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:50,938 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:50,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:50,939 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:10:50,939 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:10:50,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:50,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:10:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 99. [2019-08-05 11:10:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:50,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:50,942 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:50,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:50,942 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:50,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:50,942 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:50,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:50,943 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:50,943 INFO L418 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:50,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:50,943 INFO L82 PathProgramCache]: Analyzing trace with hash -315234616, now seen corresponding path program 321 times [2019-08-05 11:10:50,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:50,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:50,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:51,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:51,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:51,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:51,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:51,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:51,054 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:51,111 INFO L93 Difference]: Finished difference Result 167 states and 207 transitions. [2019-08-05 11:10:51,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:51,112 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:51,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:51,113 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:10:51,113 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:10:51,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:51,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:10:51,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 107. [2019-08-05 11:10:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:10:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-08-05 11:10:51,116 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 61 [2019-08-05 11:10:51,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:51,116 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-08-05 11:10:51,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-08-05 11:10:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:51,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:51,116 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:51,117 INFO L418 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:51,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:51,117 INFO L82 PathProgramCache]: Analyzing trace with hash 869993800, now seen corresponding path program 322 times [2019-08-05 11:10:51,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:51,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:51,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:51,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:51,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:51,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:51,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:51,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:51,223 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 19 states. [2019-08-05 11:10:51,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:51,277 INFO L93 Difference]: Finished difference Result 167 states and 207 transitions. [2019-08-05 11:10:51,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:51,278 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:51,279 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:10:51,279 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:10:51,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:51,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:10:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 103. [2019-08-05 11:10:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:51,282 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:51,282 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:51,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:51,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:51,283 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:51,283 INFO L418 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:51,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1368828406, now seen corresponding path program 323 times [2019-08-05 11:10:51,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:51,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:51,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:51,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:51,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:51,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:51,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:51,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:51,391 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:51,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:51,452 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2019-08-05 11:10:51,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:51,453 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:51,454 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:10:51,454 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:10:51,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:10:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 99. [2019-08-05 11:10:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:51,457 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:51,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:51,458 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:51,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:51,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:51,458 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:51,458 INFO L418 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:51,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:51,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1220379510, now seen corresponding path program 324 times [2019-08-05 11:10:51,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:51,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:51,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:51,571 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:51,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:51,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:51,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:51,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:51,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:51,572 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:51,628 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2019-08-05 11:10:51,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:51,628 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:51,629 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:51,629 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:51,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 103. [2019-08-05 11:10:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:51,632 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:51,632 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:51,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:51,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:51,633 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:51,633 INFO L418 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:51,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:51,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2020993996, now seen corresponding path program 325 times [2019-08-05 11:10:51,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:51,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:51,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:10:51,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:51,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:51,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:51,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:51,746 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:51,801 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2019-08-05 11:10:51,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:51,801 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:51,802 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:10:51,802 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:10:51,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:10:51,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 79. [2019-08-05 11:10:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:51,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:51,805 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 61 [2019-08-05 11:10:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:51,805 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:51,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:51,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:51,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:51,805 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:51,806 INFO L418 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:51,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:51,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1908260350, now seen corresponding path program 326 times [2019-08-05 11:10:51,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:51,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:51,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:51,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:51,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:51,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:51,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:51,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:51,921 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 19 states. [2019-08-05 11:10:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:51,974 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2019-08-05 11:10:51,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:51,974 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:51,975 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:51,975 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:51,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:51,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2019-08-05 11:10:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:51,978 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:51,978 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:51,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:51,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:51,979 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:51,979 INFO L418 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:51,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:51,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1333113156, now seen corresponding path program 327 times [2019-08-05 11:10:51,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:51,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:51,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:52,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:52,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:52,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:52,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:52,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:52,089 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:52,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:52,145 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2019-08-05 11:10:52,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:52,146 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:52,147 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:10:52,147 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:10:52,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:10:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 95. [2019-08-05 11:10:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:52,150 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:52,150 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:52,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:52,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:52,151 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:52,151 INFO L418 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:52,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:52,151 INFO L82 PathProgramCache]: Analyzing trace with hash 721544904, now seen corresponding path program 328 times [2019-08-05 11:10:52,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:52,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:52,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:52,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:52,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:52,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:52,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:52,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:52,261 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:52,321 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2019-08-05 11:10:52,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:52,321 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:52,322 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:10:52,322 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:10:52,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:52,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:10:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 99. [2019-08-05 11:10:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:52,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:52,326 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:52,326 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:52,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:52,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:52,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:52,327 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:52,327 INFO L418 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:52,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1481562052, now seen corresponding path program 329 times [2019-08-05 11:10:52,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:52,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:52,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:52,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:52,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:52,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:52,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:52,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:52,462 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:52,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:52,532 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2019-08-05 11:10:52,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:52,533 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:52,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:52,533 INFO L225 Difference]: With dead ends: 151 [2019-08-05 11:10:52,534 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 11:10:52,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 11:10:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 103. [2019-08-05 11:10:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:52,537 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:52,537 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:52,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:52,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:52,538 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:52,538 INFO L418 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:52,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:52,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1775138694, now seen corresponding path program 330 times [2019-08-05 11:10:52,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:52,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:52,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:52,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:52,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:52,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:52,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:52,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:52,813 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:52,895 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2019-08-05 11:10:52,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:52,895 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:52,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:52,896 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:10:52,896 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:10:52,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:52,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:10:52,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 91. [2019-08-05 11:10:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:52,899 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:52,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:52,900 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:52,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:52,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:52,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:52,900 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:52,901 INFO L418 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:52,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:52,901 INFO L82 PathProgramCache]: Analyzing trace with hash 427968262, now seen corresponding path program 331 times [2019-08-05 11:10:52,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:52,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:52,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:53,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:53,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:53,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:53,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:53,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:53,075 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:53,136 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:53,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:53,137 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:53,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:53,137 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:53,138 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:53,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:53,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:53,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 83. [2019-08-05 11:10:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:53,141 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 61 [2019-08-05 11:10:53,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:53,141 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:53,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:53,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:53,141 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:53,142 INFO L418 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:53,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:53,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1744224068, now seen corresponding path program 332 times [2019-08-05 11:10:53,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:53,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:53,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:53,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:53,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:53,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:53,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:53,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:53,250 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 19 states. [2019-08-05 11:10:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:53,304 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2019-08-05 11:10:53,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:53,305 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:53,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:53,305 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:10:53,305 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:10:53,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:10:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 91. [2019-08-05 11:10:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:53,308 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:53,309 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:53,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:53,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:53,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:53,309 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:53,309 INFO L418 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:53,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:53,310 INFO L82 PathProgramCache]: Analyzing trace with hash 690630278, now seen corresponding path program 333 times [2019-08-05 11:10:53,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:53,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:53,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:53,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:53,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:53,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:53,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:53,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:53,417 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:53,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:53,478 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2019-08-05 11:10:53,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:53,478 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:53,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:53,479 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:10:53,479 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:10:53,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:10:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 87. [2019-08-05 11:10:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:53,482 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 61 [2019-08-05 11:10:53,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:53,482 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:53,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:53,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:53,483 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:53,483 INFO L418 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:53,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:53,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1631275510, now seen corresponding path program 334 times [2019-08-05 11:10:53,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:53,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:53,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:53,590 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:53,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:53,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:53,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:53,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:53,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:53,592 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 19 states. [2019-08-05 11:10:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:53,646 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2019-08-05 11:10:53,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:53,647 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:53,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:53,648 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:10:53,648 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:10:53,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:10:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 99. [2019-08-05 11:10:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:53,651 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:53,651 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:53,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:53,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:53,652 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:53,652 INFO L418 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:53,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:53,652 INFO L82 PathProgramCache]: Analyzing trace with hash 839079174, now seen corresponding path program 335 times [2019-08-05 11:10:53,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:53,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:53,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:53,756 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:53,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:53,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:53,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:53,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:53,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:53,757 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:53,817 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2019-08-05 11:10:53,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:53,818 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:53,818 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:10:53,819 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:10:53,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:10:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 103. [2019-08-05 11:10:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:53,822 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:53,822 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:53,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:53,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:53,823 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:53,823 INFO L418 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:53,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:53,824 INFO L82 PathProgramCache]: Analyzing trace with hash -214514616, now seen corresponding path program 336 times [2019-08-05 11:10:53,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:53,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:53,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:53,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:53,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:53,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:53,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:53,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:53,942 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:53,996 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2019-08-05 11:10:53,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:53,997 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:53,998 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:10:53,998 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:10:53,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:10:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 91. [2019-08-05 11:10:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:54,001 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:54,001 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:54,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:54,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:54,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:54,001 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:54,002 INFO L418 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:54,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:54,002 INFO L82 PathProgramCache]: Analyzing trace with hash -577681720, now seen corresponding path program 337 times [2019-08-05 11:10:54,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:54,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:54,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:54,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:54,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:54,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:54,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:54,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:54,113 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:54,170 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:54,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:54,171 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:54,171 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:54,171 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:54,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 87. [2019-08-05 11:10:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:54,175 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 61 [2019-08-05 11:10:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:54,175 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:54,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:54,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:54,176 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:54,176 INFO L418 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:54,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:54,176 INFO L82 PathProgramCache]: Analyzing trace with hash -726130616, now seen corresponding path program 338 times [2019-08-05 11:10:54,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:54,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:54,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:54,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:54,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:54,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:54,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:54,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:54,280 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 19 states. [2019-08-05 11:10:54,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:54,338 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:54,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:54,338 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:54,339 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:54,339 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:54,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 91. [2019-08-05 11:10:54,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:54,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:54,342 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:54,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:54,342 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:54,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:54,342 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:54,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:54,342 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:54,343 INFO L418 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:54,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:54,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1103067708, now seen corresponding path program 339 times [2019-08-05 11:10:54,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:54,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:54,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:54,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:54,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:54,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:54,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:54,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:54,478 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:54,534 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2019-08-05 11:10:54,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:54,535 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:54,535 INFO L225 Difference]: With dead ends: 151 [2019-08-05 11:10:54,536 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 11:10:54,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:54,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 11:10:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 103. [2019-08-05 11:10:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:54,539 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:54,539 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:54,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:54,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:54,539 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:54,540 INFO L418 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:54,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:54,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2138305798, now seen corresponding path program 340 times [2019-08-05 11:10:54,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:54,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:54,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:54,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:54,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:54,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:54,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:54,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:54,644 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:54,707 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2019-08-05 11:10:54,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:54,708 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:54,708 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:10:54,708 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:10:54,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:10:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 99. [2019-08-05 11:10:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:54,712 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:54,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:54,712 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:54,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:54,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:54,713 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:54,713 INFO L418 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:54,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2008212602, now seen corresponding path program 341 times [2019-08-05 11:10:54,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:54,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:54,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:54,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:54,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:54,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:54,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:54,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:54,824 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:54,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:54,881 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2019-08-05 11:10:54,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:54,882 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:54,882 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:54,882 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:54,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 103. [2019-08-05 11:10:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:54,885 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:54,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:54,886 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:54,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:54,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:54,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:54,886 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:54,887 INFO L418 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:54,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:54,887 INFO L82 PathProgramCache]: Analyzing trace with hash 327463174, now seen corresponding path program 342 times [2019-08-05 11:10:54,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:54,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:54,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:55,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:55,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:55,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:55,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:55,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:55,078 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:55,132 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2019-08-05 11:10:55,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:55,133 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:55,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:55,133 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:10:55,134 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:10:55,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:55,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:10:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 95. [2019-08-05 11:10:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:55,137 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:55,137 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:55,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:55,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:55,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:55,137 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:55,137 INFO L418 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:55,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:55,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1233160904, now seen corresponding path program 343 times [2019-08-05 11:10:55,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:55,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:55,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:55,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:55,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:55,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:55,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:55,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:55,242 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:55,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:55,297 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2019-08-05 11:10:55,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:55,298 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:55,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:55,299 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:10:55,299 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:10:55,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:10:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 87. [2019-08-05 11:10:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:55,301 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 61 [2019-08-05 11:10:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:55,302 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:55,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:55,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:55,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:55,302 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:55,302 INFO L418 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:55,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:55,303 INFO L82 PathProgramCache]: Analyzing trace with hash -988792632, now seen corresponding path program 344 times [2019-08-05 11:10:55,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:55,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:55,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:55,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:55,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:55,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:55,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:55,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:55,409 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 19 states. [2019-08-05 11:10:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:55,467 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2019-08-05 11:10:55,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:55,468 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:55,469 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:10:55,469 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:10:55,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:55,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:10:55,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 95. [2019-08-05 11:10:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:55,473 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:55,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:55,473 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:55,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:55,473 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:55,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:55,473 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:55,473 INFO L418 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:55,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:55,474 INFO L82 PathProgramCache]: Analyzing trace with hash 64801158, now seen corresponding path program 345 times [2019-08-05 11:10:55,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:55,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:55,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:55,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:55,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:55,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:55,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:55,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:55,595 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:55,667 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:55,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:55,668 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:55,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:55,669 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:55,669 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:55,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 91. [2019-08-05 11:10:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:55,672 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:55,672 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:55,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:55,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:55,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:55,673 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:55,673 INFO L418 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:55,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:55,673 INFO L82 PathProgramCache]: Analyzing trace with hash -83647738, now seen corresponding path program 346 times [2019-08-05 11:10:55,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:55,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:55,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:55,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:55,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:55,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:55,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:55,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:55,784 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:55,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:55,842 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2019-08-05 11:10:55,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:55,842 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:55,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:55,843 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:10:55,843 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:10:55,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:10:55,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 95. [2019-08-05 11:10:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:55,845 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:55,846 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:55,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:55,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:55,846 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:55,846 INFO L418 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:55,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:55,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1745550586, now seen corresponding path program 347 times [2019-08-05 11:10:55,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:55,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:55,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:55,957 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:55,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:55,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:55,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:55,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:55,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:55,958 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:56,017 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2019-08-05 11:10:56,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:56,017 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:56,018 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:56,018 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:56,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:56,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 103. [2019-08-05 11:10:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:10:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-08-05 11:10:56,021 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 61 [2019-08-05 11:10:56,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:56,021 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-08-05 11:10:56,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-08-05 11:10:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:56,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:56,022 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:56,022 INFO L418 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:56,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:56,022 INFO L82 PathProgramCache]: Analyzing trace with hash 969946052, now seen corresponding path program 348 times [2019-08-05 11:10:56,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:56,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:56,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:56,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:56,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:56,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:56,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:56,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:56,201 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 19 states. [2019-08-05 11:10:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:56,264 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2019-08-05 11:10:56,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:56,264 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:56,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:56,265 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:10:56,265 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:10:56,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:10:56,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 83. [2019-08-05 11:10:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:56,268 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 61 [2019-08-05 11:10:56,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:56,268 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:56,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:56,268 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:56,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:56,268 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:56,268 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:56,269 INFO L418 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:56,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:56,269 INFO L82 PathProgramCache]: Analyzing trace with hash -808414388, now seen corresponding path program 349 times [2019-08-05 11:10:56,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:56,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:56,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:10:56,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:56,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:56,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:56,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:56,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:56,388 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 19 states. [2019-08-05 11:10:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:56,443 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2019-08-05 11:10:56,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:56,443 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:56,444 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:56,444 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:56,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2019-08-05 11:10:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:56,447 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:56,447 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:56,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:56,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:56,447 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:56,448 INFO L418 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:56,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:56,448 INFO L82 PathProgramCache]: Analyzing trace with hash 245179402, now seen corresponding path program 350 times [2019-08-05 11:10:56,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:56,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:56,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:56,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:56,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:56,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:56,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:56,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:56,570 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:56,624 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2019-08-05 11:10:56,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:56,624 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:56,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:56,625 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:10:56,625 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:10:56,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:10:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 95. [2019-08-05 11:10:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:56,628 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:56,629 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:56,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:56,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:56,629 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:56,629 INFO L418 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1495822920, now seen corresponding path program 351 times [2019-08-05 11:10:56,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:56,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:56,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:56,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:56,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:56,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:56,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:56,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:56,743 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:56,803 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2019-08-05 11:10:56,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:56,804 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:56,804 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:10:56,804 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:10:56,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:10:56,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2019-08-05 11:10:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:56,808 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:56,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:56,808 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:56,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:56,808 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:56,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:56,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:56,809 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:56,809 INFO L418 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:56,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:56,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1644271816, now seen corresponding path program 352 times [2019-08-05 11:10:56,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:56,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:56,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:56,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:56,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:56,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:56,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:56,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:56,915 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:56,976 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2019-08-05 11:10:56,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:56,977 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:56,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:56,978 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:10:56,978 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:10:56,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:56,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:10:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 95. [2019-08-05 11:10:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:56,981 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:56,981 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:56,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:56,981 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:56,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:56,981 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:56,981 INFO L418 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:56,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:56,982 INFO L82 PathProgramCache]: Analyzing trace with hash 96730506, now seen corresponding path program 353 times [2019-08-05 11:10:56,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:56,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:56,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:57,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:57,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:57,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:57,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:57,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:57,088 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:57,137 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2019-08-05 11:10:57,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:57,137 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:57,138 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:10:57,138 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:10:57,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:10:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 99. [2019-08-05 11:10:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:10:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-08-05 11:10:57,141 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 61 [2019-08-05 11:10:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:57,141 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-08-05 11:10:57,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-08-05 11:10:57,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:57,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:57,142 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:57,142 INFO L418 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:57,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:57,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1150324296, now seen corresponding path program 354 times [2019-08-05 11:10:57,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:57,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:57,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:57,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:57,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:57,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:57,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:57,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:57,247 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 19 states. [2019-08-05 11:10:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:57,306 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2019-08-05 11:10:57,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:57,306 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:57,307 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:10:57,307 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:10:57,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:10:57,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 91. [2019-08-05 11:10:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:57,310 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:57,310 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:57,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:57,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:57,311 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:57,311 INFO L418 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:57,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:57,311 INFO L82 PathProgramCache]: Analyzing trace with hash 590678026, now seen corresponding path program 355 times [2019-08-05 11:10:57,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:57,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:57,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:57,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:57,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:57,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:57,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:57,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:57,499 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:57,557 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2019-08-05 11:10:57,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:57,558 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:57,559 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:10:57,559 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:10:57,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:57,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:10:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 75. [2019-08-05 11:10:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:10:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-08-05 11:10:57,561 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 61 [2019-08-05 11:10:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:57,561 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-08-05 11:10:57,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-08-05 11:10:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:57,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:57,562 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:57,562 INFO L418 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:57,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:57,562 INFO L82 PathProgramCache]: Analyzing trace with hash 987614532, now seen corresponding path program 356 times [2019-08-05 11:10:57,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:57,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:57,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:57,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:57,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:57,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:57,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:57,873 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 19 states. [2019-08-05 11:10:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:57,942 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2019-08-05 11:10:57,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:57,943 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:57,944 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:10:57,944 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:10:57,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:57,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:10:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 87. [2019-08-05 11:10:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:57,948 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 61 [2019-08-05 11:10:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:57,949 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:57,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:57,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:57,949 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:57,950 INFO L418 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:57,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash -65979258, now seen corresponding path program 357 times [2019-08-05 11:10:57,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:57,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:57,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:58,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:58,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:58,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:58,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:58,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:58,160 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 19 states. [2019-08-05 11:10:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:58,220 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2019-08-05 11:10:58,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:58,221 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:58,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:58,222 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:10:58,222 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:10:58,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:10:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2019-08-05 11:10:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:58,225 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 61 [2019-08-05 11:10:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:58,225 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:58,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:58,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:58,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:58,226 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:58,226 INFO L418 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:58,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:58,226 INFO L82 PathProgramCache]: Analyzing trace with hash -165931510, now seen corresponding path program 358 times [2019-08-05 11:10:58,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:58,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:58,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:58,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:58,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:58,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:58,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:58,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:58,336 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 19 states. [2019-08-05 11:10:58,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:58,396 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-08-05 11:10:58,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:58,397 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:58,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:58,397 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:58,397 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:58,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 91. [2019-08-05 11:10:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:58,401 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:58,401 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:58,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:58,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:58,401 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:58,401 INFO L418 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:58,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:58,402 INFO L82 PathProgramCache]: Analyzing trace with hash 82469638, now seen corresponding path program 359 times [2019-08-05 11:10:58,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:58,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:58,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:58,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:58,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:58,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:58,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:58,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:58,505 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:58,565 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2019-08-05 11:10:58,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:58,565 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:58,566 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:10:58,566 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:10:58,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:10:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 95. [2019-08-05 11:10:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:58,569 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:58,569 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:58,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:58,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:58,570 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:58,570 INFO L418 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:58,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:58,570 INFO L82 PathProgramCache]: Analyzing trace with hash 887662280, now seen corresponding path program 360 times [2019-08-05 11:10:58,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:58,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:58,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:58,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:58,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:58,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:58,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:58,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:58,713 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:58,770 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2019-08-05 11:10:58,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:58,771 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:58,772 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:10:58,772 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:10:58,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:58,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:10:58,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 91. [2019-08-05 11:10:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:10:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-08-05 11:10:58,775 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 61 [2019-08-05 11:10:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:58,775 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-08-05 11:10:58,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-08-05 11:10:58,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:58,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:58,776 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:58,776 INFO L418 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:58,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:58,776 INFO L82 PathProgramCache]: Analyzing trace with hash -971124152, now seen corresponding path program 361 times [2019-08-05 11:10:58,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:58,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:58,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:58,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:58,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:58,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:58,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:58,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:58,886 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 19 states. [2019-08-05 11:10:58,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:58,944 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions. [2019-08-05 11:10:58,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:58,945 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:58,945 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:10:58,945 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:10:58,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:10:58,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 83. [2019-08-05 11:10:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:58,948 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 61 [2019-08-05 11:10:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:58,948 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:58,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:58,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:58,949 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:58,949 INFO L418 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:58,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:58,949 INFO L82 PathProgramCache]: Analyzing trace with hash 739213384, now seen corresponding path program 362 times [2019-08-05 11:10:58,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:58,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:58,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:59,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:59,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:59,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:59,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:59,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:59,056 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 19 states. [2019-08-05 11:10:59,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:59,108 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2019-08-05 11:10:59,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:59,109 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:59,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:59,109 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:10:59,110 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:10:59,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:10:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 87. [2019-08-05 11:10:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:10:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-08-05 11:10:59,113 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 61 [2019-08-05 11:10:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:59,113 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-08-05 11:10:59,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-08-05 11:10:59,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:59,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:59,113 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:59,113 INFO L418 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:59,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:59,114 INFO L82 PathProgramCache]: Analyzing trace with hash 345131654, now seen corresponding path program 363 times [2019-08-05 11:10:59,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:59,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:59,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:59,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:59,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:59,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:59,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:59,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:59,216 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 19 states. [2019-08-05 11:10:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:59,275 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2019-08-05 11:10:59,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:59,276 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:59,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:59,277 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:10:59,277 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:10:59,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:10:59,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 95. [2019-08-05 11:10:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:10:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-08-05 11:10:59,280 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2019-08-05 11:10:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:59,280 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-08-05 11:10:59,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-08-05 11:10:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:59,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:59,281 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:59,281 INFO L418 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:59,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:59,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1792807174, now seen corresponding path program 364 times [2019-08-05 11:10:59,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:59,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:59,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:10:59,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:59,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:59,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:59,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:59,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:59,393 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 19 states. [2019-08-05 11:10:59,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:59,452 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2019-08-05 11:10:59,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:59,452 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:59,453 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:10:59,453 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:10:59,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:10:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 83. [2019-08-05 11:10:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:59,457 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 61 [2019-08-05 11:10:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:59,457 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:59,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:59,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:59,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:59,457 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:59,458 INFO L418 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:59,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:59,458 INFO L82 PathProgramCache]: Analyzing trace with hash -708462136, now seen corresponding path program 365 times [2019-08-05 11:10:59,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:59,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:59,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:59,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:59,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:59,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:59,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:59,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:59,571 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 19 states. [2019-08-05 11:10:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:59,625 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-08-05 11:10:59,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:59,625 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:59,626 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:59,626 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:59,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 79. [2019-08-05 11:10:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:10:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-08-05 11:10:59,629 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 61 [2019-08-05 11:10:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:59,629 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-08-05 11:10:59,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-08-05 11:10:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:59,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:59,629 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:59,630 INFO L418 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:59,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1613607030, now seen corresponding path program 366 times [2019-08-05 11:10:59,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:59,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:59,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:10:59,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:59,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:59,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:59,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:59,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:59,732 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 19 states. [2019-08-05 11:10:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:59,789 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2019-08-05 11:10:59,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:59,790 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:59,790 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:10:59,790 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:10:59,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:59,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:10:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2019-08-05 11:10:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:10:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-08-05 11:10:59,793 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 61 [2019-08-05 11:10:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:59,793 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-08-05 11:10:59,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-08-05 11:10:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:59,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:59,794 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:59,794 INFO L418 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:59,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:59,794 INFO L82 PathProgramCache]: Analyzing trace with hash -560013240, now seen corresponding path program 367 times [2019-08-05 11:10:59,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:59,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:59,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:10:59,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:59,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:59,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:59,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:59,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:59,934 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 19 states. [2019-08-05 11:10:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:59,990 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2019-08-05 11:10:59,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:59,991 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:10:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:59,992 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:10:59,992 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:10:59,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:10:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 61. [2019-08-05 11:10:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:10:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2019-08-05 11:10:59,996 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 61 [2019-08-05 11:10:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:59,997 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2019-08-05 11:10:59,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2019-08-05 11:10:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:59,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:59,997 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1] [2019-08-05 11:10:59,998 INFO L418 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:59,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:59,998 INFO L82 PathProgramCache]: Analyzing trace with hash -73529090, now seen corresponding path program 8 times [2019-08-05 11:10:59,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:00,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:00,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 11:11:00,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:00,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:00,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:00,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:00,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:00,149 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 19 states. [2019-08-05 11:11:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:00,199 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2019-08-05 11:11:00,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:00,201 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:00,202 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:11:00,202 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:11:00,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:00,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:11:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-08-05 11:11:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:11:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-08-05 11:11:00,208 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 61 [2019-08-05 11:11:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:00,208 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-08-05 11:11:00,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-08-05 11:11:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:00,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:00,209 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:00,209 INFO L418 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:00,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:00,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1127122880, now seen corresponding path program 368 times [2019-08-05 11:11:00,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:00,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:00,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:11:00,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:00,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:00,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:00,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:00,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:00,351 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 19 states. [2019-08-05 11:11:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:00,404 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2019-08-05 11:11:00,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:00,405 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:00,405 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:11:00,406 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:11:00,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:11:00,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 85. [2019-08-05 11:11:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:11:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-08-05 11:11:00,409 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 61 [2019-08-05 11:11:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:00,409 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-08-05 11:11:00,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-08-05 11:11:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:00,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:00,410 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:00,410 INFO L418 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:00,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:00,410 INFO L82 PathProgramCache]: Analyzing trace with hash -341646004, now seen corresponding path program 369 times [2019-08-05 11:11:00,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:00,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:00,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:11:00,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:00,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:00,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:00,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:00,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:00,523 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 19 states. [2019-08-05 11:11:00,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:00,570 INFO L93 Difference]: Finished difference Result 135 states and 166 transitions. [2019-08-05 11:11:00,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:00,571 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:00,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:00,572 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:11:00,572 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:11:00,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:00,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:11:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 109. [2019-08-05 11:11:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:00,575 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:00,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:00,575 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:00,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:00,575 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:00,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:00,575 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:00,575 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:00,575 INFO L418 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:00,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:00,576 INFO L82 PathProgramCache]: Analyzing trace with hash 711947786, now seen corresponding path program 370 times [2019-08-05 11:11:00,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:00,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:00,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:00,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:00,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:00,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:00,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:00,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:00,685 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:00,739 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2019-08-05 11:11:00,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:00,739 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:00,740 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:11:00,740 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:11:00,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:11:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 105. [2019-08-05 11:11:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:00,743 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:00,743 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:00,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:00,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:00,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:00,744 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:00,744 INFO L418 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:00,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:00,744 INFO L82 PathProgramCache]: Analyzing trace with hash 563498890, now seen corresponding path program 371 times [2019-08-05 11:11:00,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:00,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:00,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:00,849 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:00,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:00,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:00,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:00,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:00,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:00,850 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:00,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:00,905 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2019-08-05 11:11:00,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:00,905 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:00,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:00,906 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:11:00,906 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:11:00,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:11:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 109. [2019-08-05 11:11:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:00,909 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:00,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:00,909 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:00,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:00,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:00,910 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:00,910 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:00,910 INFO L418 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:00,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:00,910 INFO L82 PathProgramCache]: Analyzing trace with hash -978673984, now seen corresponding path program 372 times [2019-08-05 11:11:00,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:00,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:00,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:11:01,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:01,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:01,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:01,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:01,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:01,018 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:01,073 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2019-08-05 11:11:01,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:01,073 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:01,074 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:11:01,074 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:11:01,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:01,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:11:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 113. [2019-08-05 11:11:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:01,078 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:01,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:01,078 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:01,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:01,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:01,079 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:01,079 INFO L418 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:01,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:01,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2032267774, now seen corresponding path program 373 times [2019-08-05 11:11:01,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:01,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:01,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:01,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:01,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:01,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:01,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:01,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:01,185 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:01,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:01,244 INFO L93 Difference]: Finished difference Result 151 states and 186 transitions. [2019-08-05 11:11:01,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:01,244 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:01,245 INFO L225 Difference]: With dead ends: 151 [2019-08-05 11:11:01,245 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 11:11:01,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:01,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 11:11:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2019-08-05 11:11:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:01,248 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:01,248 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:01,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:01,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:01,249 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:01,249 INFO L418 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:01,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:01,249 INFO L82 PathProgramCache]: Analyzing trace with hash -716011968, now seen corresponding path program 374 times [2019-08-05 11:11:01,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:01,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:01,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:11:01,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:01,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:01,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:01,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:01,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:01,422 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:01,471 INFO L93 Difference]: Finished difference Result 167 states and 206 transitions. [2019-08-05 11:11:01,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:01,472 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:01,473 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:11:01,473 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:11:01,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:11:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 113. [2019-08-05 11:11:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:01,476 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:01,476 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:01,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:01,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:01,477 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:01,477 INFO L418 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:01,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:01,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1617092680, now seen corresponding path program 375 times [2019-08-05 11:11:01,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:01,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:01,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:01,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:01,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:01,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:01,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:01,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:01,580 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:01,633 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:01,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:01,633 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:01,634 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:01,634 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:01,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 105. [2019-08-05 11:11:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:01,637 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:01,638 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:01,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:01,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:01,638 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:01,638 INFO L418 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:01,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:01,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1769605758, now seen corresponding path program 376 times [2019-08-05 11:11:01,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:01,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:01,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:01,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:01,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:01,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:01,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:01,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:01,797 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:01,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:01,853 INFO L93 Difference]: Finished difference Result 159 states and 196 transitions. [2019-08-05 11:11:01,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:01,853 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:01,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:01,854 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:11:01,854 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:11:01,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:11:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 101. [2019-08-05 11:11:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:01,857 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 61 [2019-08-05 11:11:01,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:01,858 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:01,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:01,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:01,858 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:01,859 INFO L418 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:01,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:01,859 INFO L82 PathProgramCache]: Analyzing trace with hash 300836874, now seen corresponding path program 377 times [2019-08-05 11:11:01,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:01,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:01,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:01,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:01,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:01,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:01,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:01,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:01,972 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 19 states. [2019-08-05 11:11:02,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:02,028 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:02,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:02,029 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:02,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:02,029 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:02,030 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:02,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:02,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:02,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 109. [2019-08-05 11:11:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:02,033 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:02,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:02,033 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:02,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:02,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:02,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:02,034 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:02,034 INFO L418 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:02,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:02,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1354430664, now seen corresponding path program 378 times [2019-08-05 11:11:02,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:02,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:02,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:02,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:02,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:02,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:02,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:02,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:02,147 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:02,207 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:02,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:02,207 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:02,208 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:02,208 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:02,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 105. [2019-08-05 11:11:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:02,211 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:02,211 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:02,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:02,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:02,212 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:02,212 INFO L418 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:02,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1205981768, now seen corresponding path program 379 times [2019-08-05 11:11:02,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:02,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:02,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:02,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:02,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:02,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:02,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:02,316 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:02,379 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:02,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:02,380 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:02,380 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:02,380 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:02,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 109. [2019-08-05 11:11:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:02,383 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:02,384 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:02,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:02,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:02,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:02,384 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:02,384 INFO L418 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:02,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2035391738, now seen corresponding path program 380 times [2019-08-05 11:11:02,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:02,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:02,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:02,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:02,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:02,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:02,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:02,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:02,500 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:02,560 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:02,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:02,561 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:02,562 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:02,562 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:02,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:02,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2019-08-05 11:11:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:11:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-08-05 11:11:02,566 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 61 [2019-08-05 11:11:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:02,566 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-08-05 11:11:02,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-08-05 11:11:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:02,567 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:02,567 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:02,567 INFO L418 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:02,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1146838646, now seen corresponding path program 381 times [2019-08-05 11:11:02,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:02,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:02,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:03,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:03,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:03,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:03,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:03,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:03,232 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 19 states. [2019-08-05 11:11:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:03,289 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:03,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:03,289 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:03,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:03,290 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:03,290 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:03,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 109. [2019-08-05 11:11:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:03,294 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:03,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:03,294 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:03,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:03,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:03,294 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:03,295 INFO L418 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:03,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:03,295 INFO L82 PathProgramCache]: Analyzing trace with hash -93244856, now seen corresponding path program 382 times [2019-08-05 11:11:03,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:03,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:03,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:03,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:03,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:03,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:03,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:03,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:03,408 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:03,467 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2019-08-05 11:11:03,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:03,468 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:03,469 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:11:03,469 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:11:03,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:11:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 105. [2019-08-05 11:11:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:03,472 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:03,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:03,472 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:03,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:03,472 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:03,472 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:03,472 INFO L418 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:03,473 INFO L82 PathProgramCache]: Analyzing trace with hash -241693752, now seen corresponding path program 383 times [2019-08-05 11:11:03,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:03,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:03,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:03,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:03,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:03,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:03,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:03,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:03,580 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:03,641 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-08-05 11:11:03,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:03,642 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:03,643 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:03,643 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:03,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 109. [2019-08-05 11:11:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:03,646 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:03,647 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:03,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:03,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:03,647 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:03,647 INFO L418 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:03,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:03,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1621156862, now seen corresponding path program 384 times [2019-08-05 11:11:03,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:03,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:03,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:03,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:03,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:03,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:03,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:03,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:03,754 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:03,812 INFO L93 Difference]: Finished difference Result 167 states and 206 transitions. [2019-08-05 11:11:03,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:03,812 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:03,813 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:11:03,813 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:11:03,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:11:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 113. [2019-08-05 11:11:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:03,817 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:03,817 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:03,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:03,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:03,817 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:03,818 INFO L418 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:03,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:03,818 INFO L82 PathProgramCache]: Analyzing trace with hash 811900038, now seen corresponding path program 385 times [2019-08-05 11:11:03,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:03,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:03,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:03,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:03,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:03,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:03,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:03,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:03,958 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:04,020 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:04,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:04,021 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:04,022 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:04,022 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:04,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:04,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 105. [2019-08-05 11:11:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:04,025 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:04,025 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:04,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:04,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:04,026 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:04,026 INFO L418 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:04,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:04,026 INFO L82 PathProgramCache]: Analyzing trace with hash -504355768, now seen corresponding path program 386 times [2019-08-05 11:11:04,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:04,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:04,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:04,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:04,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:04,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:04,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:04,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:04,135 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:04,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:04,188 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:04,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:04,189 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:04,190 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:04,190 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:04,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:04,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2019-08-05 11:11:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:04,193 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:04,193 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:04,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:04,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:04,194 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:04,194 INFO L418 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:04,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1620216644, now seen corresponding path program 387 times [2019-08-05 11:11:04,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:04,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:04,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:04,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:04,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:04,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:04,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:04,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:04,355 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:04,415 INFO L93 Difference]: Finished difference Result 159 states and 196 transitions. [2019-08-05 11:11:04,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:04,415 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:04,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:04,416 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:11:04,416 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:11:04,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:11:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 101. [2019-08-05 11:11:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:04,419 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 61 [2019-08-05 11:11:04,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:04,420 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:04,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:04,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:04,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:04,420 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:04,420 INFO L418 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:04,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:04,421 INFO L82 PathProgramCache]: Analyzing trace with hash 731663552, now seen corresponding path program 388 times [2019-08-05 11:11:04,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:04,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:04,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:11:04,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:04,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:04,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:04,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:04,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:04,526 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 19 states. [2019-08-05 11:11:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:04,579 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2019-08-05 11:11:04,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:04,579 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:04,580 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:11:04,580 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:11:04,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:11:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 113. [2019-08-05 11:11:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:04,584 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:04,584 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:04,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:04,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:04,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:04,584 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:04,584 INFO L418 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:04,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:04,585 INFO L82 PathProgramCache]: Analyzing trace with hash 549238022, now seen corresponding path program 389 times [2019-08-05 11:11:04,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:04,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:04,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:04,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:04,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:04,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:04,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:04,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:04,696 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:04,752 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:04,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:04,753 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:04,754 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:04,754 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:04,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:04,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 109. [2019-08-05 11:11:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:04,757 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:04,757 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:04,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:04,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:04,758 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:04,758 INFO L418 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:04,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:04,758 INFO L82 PathProgramCache]: Analyzing trace with hash -321930238, now seen corresponding path program 390 times [2019-08-05 11:11:04,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:04,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:04,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:04,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:04,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:04,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:04,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:04,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:04,868 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:04,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:04,929 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2019-08-05 11:11:04,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:04,929 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:04,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:04,930 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:04,930 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:04,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:04,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2019-08-05 11:11:04,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:04,933 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:04,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:04,934 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:04,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:04,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:04,934 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:04,934 INFO L418 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:04,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:04,935 INFO L82 PathProgramCache]: Analyzing trace with hash -173481342, now seen corresponding path program 391 times [2019-08-05 11:11:04,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:04,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:04,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:05,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:05,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:05,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:05,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:05,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:05,049 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:05,108 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:05,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:05,108 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:05,109 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:05,109 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:05,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:05,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 109. [2019-08-05 11:11:05,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:05,113 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:05,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:05,113 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:05,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:05,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:05,113 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:05,114 INFO L418 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:05,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:05,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1227075132, now seen corresponding path program 392 times [2019-08-05 11:11:05,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:05,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:05,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:05,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:05,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:05,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:05,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:05,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:05,220 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:05,283 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2019-08-05 11:11:05,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:05,284 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:05,285 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:11:05,285 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:11:05,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:05,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:11:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 101. [2019-08-05 11:11:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:05,288 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 61 [2019-08-05 11:11:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:05,288 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:05,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:05,289 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:05,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:05,289 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:05,289 INFO L418 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:05,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:05,289 INFO L82 PathProgramCache]: Analyzing trace with hash 400789126, now seen corresponding path program 393 times [2019-08-05 11:11:05,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:05,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:05,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:05,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:05,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:05,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:05,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:05,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:05,396 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 19 states. [2019-08-05 11:11:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:05,454 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:05,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:05,455 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:05,455 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:05,456 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:05,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 105. [2019-08-05 11:11:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:05,459 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:05,459 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:05,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:05,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:05,460 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:05,460 INFO L418 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1454382916, now seen corresponding path program 394 times [2019-08-05 11:11:05,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:05,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:05,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:05,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:05,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:05,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:05,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:05,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:05,619 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:05,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:05,671 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:05,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:05,672 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:05,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:05,672 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:05,673 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:05,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:05,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 89. [2019-08-05 11:11:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:11:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-08-05 11:11:05,676 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 61 [2019-08-05 11:11:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:05,676 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-08-05 11:11:05,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-08-05 11:11:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:05,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:05,676 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:05,677 INFO L418 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:05,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:05,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1057446410, now seen corresponding path program 395 times [2019-08-05 11:11:05,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:05,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:05,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:05,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:05,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:05,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:05,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:05,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:05,781 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 19 states. [2019-08-05 11:11:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:05,838 INFO L93 Difference]: Finished difference Result 165 states and 204 transitions. [2019-08-05 11:11:05,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:05,838 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:05,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:05,839 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:11:05,839 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:11:05,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:11:05,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 105. [2019-08-05 11:11:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:05,843 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:05,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:05,843 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:05,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:05,843 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:05,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:05,844 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:05,844 INFO L418 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:05,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:05,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2111040200, now seen corresponding path program 396 times [2019-08-05 11:11:05,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:05,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:05,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:05,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:05,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:05,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:05,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:05,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:05,957 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:06,015 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:06,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:06,015 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:06,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:06,016 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:06,016 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:06,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:06,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:06,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 101. [2019-08-05 11:11:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:06,020 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 61 [2019-08-05 11:11:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:06,020 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:06,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:06,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:06,020 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:06,020 INFO L418 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:06,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:06,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1962591304, now seen corresponding path program 397 times [2019-08-05 11:11:06,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:06,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:06,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:06,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:06,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:06,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:06,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:06,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:06,129 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 19 states. [2019-08-05 11:11:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:06,183 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-08-05 11:11:06,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:06,184 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:06,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:06,184 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:06,185 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:06,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:06,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2019-08-05 11:11:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:06,189 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:06,189 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:06,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:06,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:06,190 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:06,190 INFO L418 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:06,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:06,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1278782202, now seen corresponding path program 398 times [2019-08-05 11:11:06,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:06,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:06,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:06,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:06,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:06,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:06,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:06,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:06,310 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:06,371 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-08-05 11:11:06,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:06,372 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:06,372 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:06,372 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:06,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:06,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 97. [2019-08-05 11:11:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:11:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-08-05 11:11:06,376 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 61 [2019-08-05 11:11:06,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:06,376 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-08-05 11:11:06,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-08-05 11:11:06,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:06,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:06,377 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:06,377 INFO L418 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:06,377 INFO L82 PathProgramCache]: Analyzing trace with hash 89180674, now seen corresponding path program 399 times [2019-08-05 11:11:06,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:06,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:06,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:06,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:06,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:06,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:06,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:06,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:06,489 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 19 states. [2019-08-05 11:11:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:06,547 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2019-08-05 11:11:06,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:06,548 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:06,548 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:11:06,548 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:11:06,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:06,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:11:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 105. [2019-08-05 11:11:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:06,552 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:06,552 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:06,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:06,552 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:06,552 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:06,552 INFO L418 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:06,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:06,553 INFO L82 PathProgramCache]: Analyzing trace with hash -964413116, now seen corresponding path program 400 times [2019-08-05 11:11:06,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:06,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:06,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:06,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:06,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:06,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:06,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:06,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:06,661 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:06,722 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2019-08-05 11:11:06,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:06,722 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:06,723 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:11:06,723 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:11:06,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:11:06,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 101. [2019-08-05 11:11:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:06,726 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 61 [2019-08-05 11:11:06,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:06,726 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:06,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:06,726 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:06,727 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:06,727 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:06,727 INFO L418 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:06,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:06,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1699929288, now seen corresponding path program 401 times [2019-08-05 11:11:06,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:06,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:06,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:06,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:06,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:06,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:06,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:06,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:06,835 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 19 states. [2019-08-05 11:11:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:06,894 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-08-05 11:11:06,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:06,894 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:06,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:06,895 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:06,895 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:06,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:06,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 109. [2019-08-05 11:11:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:06,899 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:06,899 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:06,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:06,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:06,900 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:06,900 INFO L418 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:06,900 INFO L82 PathProgramCache]: Analyzing trace with hash -815964220, now seen corresponding path program 402 times [2019-08-05 11:11:06,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:06,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:06,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:07,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:07,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:07,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:07,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:07,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:07,001 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:07,056 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2019-08-05 11:11:07,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:07,057 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:07,058 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:07,058 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:07,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 113. [2019-08-05 11:11:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:07,062 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:07,063 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:07,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:07,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:07,063 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:07,064 INFO L418 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:07,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:07,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1869558010, now seen corresponding path program 403 times [2019-08-05 11:11:07,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:07,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:07,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:07,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:07,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:07,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:07,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:07,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:07,246 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:07,305 INFO L93 Difference]: Finished difference Result 167 states and 206 transitions. [2019-08-05 11:11:07,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:07,305 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:07,306 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:11:07,306 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:11:07,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:07,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:11:07,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 97. [2019-08-05 11:11:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:11:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-08-05 11:11:07,309 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 61 [2019-08-05 11:11:07,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:07,309 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-08-05 11:11:07,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-08-05 11:11:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:07,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:07,310 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:07,310 INFO L418 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:07,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:07,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1472621504, now seen corresponding path program 404 times [2019-08-05 11:11:07,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:07,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:07,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:11:07,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:07,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:07,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:07,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:07,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:07,424 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 19 states. [2019-08-05 11:11:07,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:07,475 INFO L93 Difference]: Finished difference Result 167 states and 206 transitions. [2019-08-05 11:11:07,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:07,475 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:07,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:07,476 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:11:07,476 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:11:07,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:07,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:11:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 113. [2019-08-05 11:11:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:07,479 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:07,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:07,479 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:07,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:07,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:07,480 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:07,480 INFO L418 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:07,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:07,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1541444218, now seen corresponding path program 405 times [2019-08-05 11:11:07,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:07,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:07,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:07,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:07,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:07,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:07,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:07,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:07,585 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:07,649 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-08-05 11:11:07,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:07,650 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:07,650 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:07,651 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:07,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:07,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:07,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 109. [2019-08-05 11:11:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:07,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:07,654 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:07,654 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:07,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:07,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:07,655 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:07,655 INFO L418 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:07,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:07,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1689893114, now seen corresponding path program 406 times [2019-08-05 11:11:07,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:07,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:07,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:07,833 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:07,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:07,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:07,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:07,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:07,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:07,834 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:07,911 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-08-05 11:11:07,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:07,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:07,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:07,912 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:07,912 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:07,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:07,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 113. [2019-08-05 11:11:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:07,915 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:07,915 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:07,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:07,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:07,915 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:07,915 INFO L418 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:07,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash -636299324, now seen corresponding path program 407 times [2019-08-05 11:11:07,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:07,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:07,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:08,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:08,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:08,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:08,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:08,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:08,350 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:08,409 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-08-05 11:11:08,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:08,409 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:08,410 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:08,410 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:08,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 101. [2019-08-05 11:11:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:08,413 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 61 [2019-08-05 11:11:08,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:08,414 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:08,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:08,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:08,414 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:08,414 INFO L418 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:08,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1768752002, now seen corresponding path program 408 times [2019-08-05 11:11:08,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:08,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:08,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:08,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:08,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:08,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:08,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:08,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:08,554 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 19 states. [2019-08-05 11:11:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:08,609 INFO L93 Difference]: Finished difference Result 167 states and 206 transitions. [2019-08-05 11:11:08,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:08,610 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:08,610 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:11:08,611 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:11:08,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:08,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:11:08,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 97. [2019-08-05 11:11:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:11:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-08-05 11:11:08,614 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 61 [2019-08-05 11:11:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:08,614 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-08-05 11:11:08,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-08-05 11:11:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:08,614 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:08,614 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:08,614 INFO L418 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:08,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:08,615 INFO L82 PathProgramCache]: Analyzing trace with hash 252253768, now seen corresponding path program 409 times [2019-08-05 11:11:08,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:08,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:08,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:08,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:08,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:08,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:08,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:08,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:08,722 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 19 states. [2019-08-05 11:11:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:08,786 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-08-05 11:11:08,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:08,787 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:08,787 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:08,787 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:08,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 109. [2019-08-05 11:11:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:08,791 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:08,791 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:08,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:08,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:08,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:08,792 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:08,792 INFO L418 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:08,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:08,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1305847558, now seen corresponding path program 410 times [2019-08-05 11:11:08,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:08,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:08,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:08,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:08,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:08,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:08,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:08,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:08,892 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:08,951 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-08-05 11:11:08,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:08,951 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:08,952 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:08,952 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:08,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:08,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2019-08-05 11:11:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:08,956 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:08,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:08,956 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:08,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:08,956 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:08,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:08,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:08,956 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:08,957 INFO L418 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:08,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:08,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1917200898, now seen corresponding path program 411 times [2019-08-05 11:11:08,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:08,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:08,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:09,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:09,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:09,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:09,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:09,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:09,069 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:09,160 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2019-08-05 11:11:09,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:09,161 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:09,162 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:11:09,162 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:11:09,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:09,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:11:09,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 109. [2019-08-05 11:11:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:09,165 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:09,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:09,166 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:09,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:09,166 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:09,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:09,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:09,166 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:09,166 INFO L418 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:09,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:09,166 INFO L82 PathProgramCache]: Analyzing trace with hash 863607108, now seen corresponding path program 412 times [2019-08-05 11:11:09,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:09,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:09,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:09,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:09,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:09,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:09,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:09,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:09,271 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:09,325 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2019-08-05 11:11:09,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:09,326 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:09,326 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:11:09,326 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:11:09,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:09,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:11:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 101. [2019-08-05 11:11:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:09,330 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 61 [2019-08-05 11:11:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:09,330 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:09,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:09,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:09,331 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:09,331 INFO L418 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:09,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:09,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1157398662, now seen corresponding path program 413 times [2019-08-05 11:11:09,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:09,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:09,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:09,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:09,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:09,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:09,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:09,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:09,439 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 19 states. [2019-08-05 11:11:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:09,498 INFO L93 Difference]: Finished difference Result 171 states and 212 transitions. [2019-08-05 11:11:09,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:09,498 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:09,499 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:11:09,499 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:11:09,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:11:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 105. [2019-08-05 11:11:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:09,503 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:09,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:09,503 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:09,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:09,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:09,503 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:09,504 INFO L418 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:09,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:09,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2083974844, now seen corresponding path program 414 times [2019-08-05 11:11:09,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:09,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:09,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:09,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:09,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:09,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:09,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:09,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:09,615 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:09,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:09,672 INFO L93 Difference]: Finished difference Result 171 states and 212 transitions. [2019-08-05 11:11:09,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:09,673 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:09,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:09,674 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:11:09,674 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:11:09,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:09,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:11:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 97. [2019-08-05 11:11:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:11:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-08-05 11:11:09,677 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 61 [2019-08-05 11:11:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:09,677 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-08-05 11:11:09,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-08-05 11:11:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:09,677 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:09,678 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:09,678 INFO L418 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:09,678 INFO L82 PathProgramCache]: Analyzing trace with hash 894736646, now seen corresponding path program 415 times [2019-08-05 11:11:09,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:09,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:09,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:09,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:09,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:09,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:09,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:09,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:09,780 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 19 states. [2019-08-05 11:11:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:09,841 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-08-05 11:11:09,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:09,841 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:09,842 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:09,842 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:09,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2019-08-05 11:11:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:09,845 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:09,845 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:09,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:09,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:09,846 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:09,846 INFO L418 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:09,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:09,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2115104382, now seen corresponding path program 416 times [2019-08-05 11:11:09,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:09,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:09,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:09,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:09,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:09,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:09,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:09,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:09,961 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:10,025 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2019-08-05 11:11:10,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:10,026 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:10,026 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:11:10,027 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:11:10,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:11:10,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 113. [2019-08-05 11:11:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:10,030 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:10,031 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:10,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:10,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:10,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:10,031 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:10,031 INFO L418 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:10,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:10,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1948330436, now seen corresponding path program 417 times [2019-08-05 11:11:10,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:10,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:10,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:10,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:10,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:10,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:10,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:10,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:10,134 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:10,192 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:10,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:10,192 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:10,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:10,193 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:10,193 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:10,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 109. [2019-08-05 11:11:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:10,197 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:10,197 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:10,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:10,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:10,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:10,197 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:10,198 INFO L418 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:10,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:10,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1126269124, now seen corresponding path program 418 times [2019-08-05 11:11:10,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:10,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:10,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:10,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:10,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:10,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:10,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:10,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:10,339 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:10,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:10,393 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:10,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:10,394 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:10,395 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:10,395 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:10,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 105. [2019-08-05 11:11:10,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:10,398 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:10,398 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:10,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:10,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:10,398 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:10,399 INFO L418 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:10,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:10,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1274718020, now seen corresponding path program 419 times [2019-08-05 11:11:10,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:10,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:10,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:10,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:10,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:10,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:10,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:10,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:10,555 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:10,613 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:10,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:10,613 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:10,614 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:10,614 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:10,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:10,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 109. [2019-08-05 11:11:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:10,617 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:10,617 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:10,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:10,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:10,617 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:10,618 INFO L418 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:10,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash 221124230, now seen corresponding path program 420 times [2019-08-05 11:11:10,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:10,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:10,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:10,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:10,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:10,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:10,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:10,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:10,731 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:10,785 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2019-08-05 11:11:10,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:10,786 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:10,786 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:11:10,786 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:11:10,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:11:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 97. [2019-08-05 11:11:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:11:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-08-05 11:11:10,789 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 61 [2019-08-05 11:11:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:10,789 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-08-05 11:11:10,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-08-05 11:11:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:10,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:10,790 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:10,790 INFO L418 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:10,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:10,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1799881540, now seen corresponding path program 421 times [2019-08-05 11:11:10,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:10,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:10,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:10,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:10,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:10,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:10,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:10,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:10,889 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 19 states. [2019-08-05 11:11:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:10,945 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2019-08-05 11:11:10,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:10,946 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:10,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:10,946 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:11:10,947 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:11:10,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:11:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 101. [2019-08-05 11:11:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:10,950 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 61 [2019-08-05 11:11:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:10,950 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:10,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:10,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:10,951 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:10,951 INFO L418 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:10,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:10,951 INFO L82 PathProgramCache]: Analyzing trace with hash -667428862, now seen corresponding path program 422 times [2019-08-05 11:11:10,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:10,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:10,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:11,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:11,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:11,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:11,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:11,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:11,061 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 19 states. [2019-08-05 11:11:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:11,117 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2019-08-05 11:11:11,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:11,118 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:11,118 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:11:11,119 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:11:11,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:11,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:11:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 113. [2019-08-05 11:11:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:11,122 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:11,123 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:11,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:11,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:11,123 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:11,123 INFO L418 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:11,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:11,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1441491966, now seen corresponding path program 423 times [2019-08-05 11:11:11,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:11,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:11,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:11,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:11,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:11,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:11,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:11,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:11,234 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:11,293 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:11,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:11,293 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:11,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:11,294 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:11,294 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:11,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 93. [2019-08-05 11:11:11,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:11:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2019-08-05 11:11:11,297 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 61 [2019-08-05 11:11:11,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:11,298 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2019-08-05 11:11:11,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2019-08-05 11:11:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:11,298 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:11,298 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:11,298 INFO L418 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:11,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:11,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1075114890, now seen corresponding path program 424 times [2019-08-05 11:11:11,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:11,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:11,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:11,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:11,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:11,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:11,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:11,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:11,405 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 19 states. [2019-08-05 11:11:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:11,475 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:11,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:11,475 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:11,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:11,476 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:11,476 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:11,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 113. [2019-08-05 11:11:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:11,479 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:11,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:11,480 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:11,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:11,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:11,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:11,480 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:11,480 INFO L418 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:11,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:11,481 INFO L82 PathProgramCache]: Analyzing trace with hash 2128708680, now seen corresponding path program 425 times [2019-08-05 11:11:11,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:11,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:11,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:11,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:11,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:11,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:11,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:11,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:11,587 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:11,649 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2019-08-05 11:11:11,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:11,650 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:11,650 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:11:11,650 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:11:11,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:11,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:11:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 109. [2019-08-05 11:11:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:11,654 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:11,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:11,654 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:11,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:11,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:11,655 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:11,655 INFO L418 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:11,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:11,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1980259784, now seen corresponding path program 426 times [2019-08-05 11:11:11,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:11,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:11,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:11,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:11,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:11,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:11,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:11,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:11,761 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:11,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:11,820 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:11,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:11,821 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:11,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:11,821 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:11,821 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:11,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2019-08-05 11:11:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:11,825 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:11,825 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:11,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:11,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:11,826 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:11,826 INFO L418 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:11,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:11,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1261113722, now seen corresponding path program 427 times [2019-08-05 11:11:11,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:11,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:11,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:11,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:11,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:11,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:11,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:11,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:11,986 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:12,046 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:12,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:12,047 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:12,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:12,048 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:12,048 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:12,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:12,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 105. [2019-08-05 11:11:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:12,052 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:12,052 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:12,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:12,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:12,052 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:12,052 INFO L418 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:12,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:12,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1717597768, now seen corresponding path program 428 times [2019-08-05 11:11:12,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:12,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:12,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:12,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:12,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:12,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:12,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:12,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:12,164 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:12,224 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-08-05 11:11:12,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:12,224 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:12,225 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:12,225 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:12,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:12,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 113. [2019-08-05 11:11:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:12,229 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:12,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:12,229 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:12,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:12,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:12,229 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:12,229 INFO L418 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1721022652, now seen corresponding path program 429 times [2019-08-05 11:11:12,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:12,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:12,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:12,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:12,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:12,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:12,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:12,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:12,332 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:12,392 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:12,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:12,393 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:12,394 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:12,394 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:12,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 109. [2019-08-05 11:11:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:12,397 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:12,397 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:12,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:12,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:12,398 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:12,398 INFO L418 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:12,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:12,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1523775738, now seen corresponding path program 430 times [2019-08-05 11:11:12,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:12,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:12,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:12,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:12,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:12,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:12,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:12,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:12,508 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:12,573 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-08-05 11:11:12,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:12,573 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:12,574 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:12,574 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:12,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2019-08-05 11:11:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:12,578 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:12,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:12,578 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:12,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:12,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:12,578 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:12,578 INFO L418 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:12,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:12,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1572573756, now seen corresponding path program 431 times [2019-08-05 11:11:12,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:12,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:12,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:12,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:12,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:12,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:12,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:12,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:12,701 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:12,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:12,759 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2019-08-05 11:11:12,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:12,759 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:12,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:12,760 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:11:12,760 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:11:12,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:11:12,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 109. [2019-08-05 11:11:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:12,763 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:12,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:12,764 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:12,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:12,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:12,764 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:12,764 INFO L418 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:12,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:12,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1668799750, now seen corresponding path program 432 times [2019-08-05 11:11:12,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:12,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:12,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:12,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:12,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:12,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:12,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:12,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:12,914 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:12,970 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2019-08-05 11:11:12,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:12,971 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:12,972 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:11:12,972 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:11:12,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:12,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:11:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 101. [2019-08-05 11:11:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:12,975 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 61 [2019-08-05 11:11:12,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:12,976 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:12,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:12,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:12,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:12,976 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:12,976 INFO L418 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:12,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:12,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1672224634, now seen corresponding path program 433 times [2019-08-05 11:11:12,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:12,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:12,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:13,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:13,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:13,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:13,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:13,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:13,313 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 19 states. [2019-08-05 11:11:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:13,421 INFO L93 Difference]: Finished difference Result 171 states and 212 transitions. [2019-08-05 11:11:13,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:13,422 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:13,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:13,422 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:11:13,423 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:11:13,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:13,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:11:13,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 105. [2019-08-05 11:11:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:13,426 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:13,426 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:13,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:13,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:13,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:13,426 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:13,427 INFO L418 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:13,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:13,427 INFO L82 PathProgramCache]: Analyzing trace with hash -618630844, now seen corresponding path program 434 times [2019-08-05 11:11:13,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:13,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:13,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:13,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:13,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:13,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:13,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:13,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:13,534 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:13,591 INFO L93 Difference]: Finished difference Result 171 states and 212 transitions. [2019-08-05 11:11:13,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:13,592 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:13,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:13,593 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:11:13,593 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:11:13,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:11:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 93. [2019-08-05 11:11:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:11:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2019-08-05 11:11:13,596 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 61 [2019-08-05 11:11:13,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:13,597 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2019-08-05 11:11:13,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2019-08-05 11:11:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:13,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:13,597 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:13,597 INFO L418 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:13,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:13,597 INFO L82 PathProgramCache]: Analyzing trace with hash 269922248, now seen corresponding path program 435 times [2019-08-05 11:11:13,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:13,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:13,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:13,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:13,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:13,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:13,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:13,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:13,698 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 19 states. [2019-08-05 11:11:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:13,761 INFO L93 Difference]: Finished difference Result 171 states and 212 transitions. [2019-08-05 11:11:13,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:13,762 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:13,763 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:11:13,763 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:11:13,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:13,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:11:13,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 105. [2019-08-05 11:11:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:13,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:13,766 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:13,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:13,766 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:13,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:13,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:13,767 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:13,767 INFO L418 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:13,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:13,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1309911740, now seen corresponding path program 436 times [2019-08-05 11:11:13,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:13,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:13,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:13,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:13,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:13,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:13,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:13,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:13,882 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:13,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:13,942 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:13,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:13,942 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:13,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:13,943 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:13,943 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:13,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:13,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:13,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 113. [2019-08-05 11:11:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:13,946 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:13,946 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:13,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:13,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:13,947 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:13,947 INFO L418 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:13,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:13,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1931461766, now seen corresponding path program 437 times [2019-08-05 11:11:13,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:13,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:13,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:14,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:14,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:14,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:14,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:14,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:14,048 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:14,103 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:14,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:14,104 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:14,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:14,105 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:14,105 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:14,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:14,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:14,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 109. [2019-08-05 11:11:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:14,108 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:14,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:14,108 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:14,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:14,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:14,109 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:14,109 INFO L418 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:14,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:14,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2079910662, now seen corresponding path program 438 times [2019-08-05 11:11:14,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:14,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:14,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:14,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:14,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:14,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:14,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:14,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:14,216 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:14,278 INFO L93 Difference]: Finished difference Result 179 states and 221 transitions. [2019-08-05 11:11:14,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:14,278 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:14,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:14,279 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:14,279 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:14,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:14,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 113. [2019-08-05 11:11:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:14,282 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:14,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:14,282 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:14,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:14,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:14,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:14,283 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:14,283 INFO L418 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:14,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:14,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1026316872, now seen corresponding path program 439 times [2019-08-05 11:11:14,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:14,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:14,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:14,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:14,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:14,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:14,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:14,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:14,390 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:14,445 INFO L93 Difference]: Finished difference Result 167 states and 206 transitions. [2019-08-05 11:11:14,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:14,446 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:14,446 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:11:14,447 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:11:14,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:11:14,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 93. [2019-08-05 11:11:14,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:11:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2019-08-05 11:11:14,450 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 61 [2019-08-05 11:11:14,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:14,450 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2019-08-05 11:11:14,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2019-08-05 11:11:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:14,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:14,451 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:14,451 INFO L418 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:14,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:14,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1490289984, now seen corresponding path program 440 times [2019-08-05 11:11:14,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:14,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:14,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:11:14,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:14,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:14,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:14,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:14,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:14,569 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 19 states. [2019-08-05 11:11:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:14,624 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2019-08-05 11:11:14,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:14,624 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:14,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:14,625 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:11:14,625 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:11:14,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:11:14,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 113. [2019-08-05 11:11:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:14,628 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:14,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:14,628 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:14,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:14,629 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:14,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:14,629 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:14,629 INFO L418 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:14,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:14,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1323516038, now seen corresponding path program 441 times [2019-08-05 11:11:14,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:14,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:14,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:14,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:14,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:14,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:14,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:14,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:14,729 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:14,788 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-08-05 11:11:14,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:14,788 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:14,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:14,789 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:14,789 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:14,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:14,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:14,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 109. [2019-08-05 11:11:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:14,792 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:14,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:14,793 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:14,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:14,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:14,793 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:14,793 INFO L418 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:14,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1751083522, now seen corresponding path program 442 times [2019-08-05 11:11:14,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:14,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:14,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:14,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:14,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:14,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:14,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:14,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:14,899 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:14,955 INFO L93 Difference]: Finished difference Result 179 states and 221 transitions. [2019-08-05 11:11:14,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:14,956 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:14,956 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:14,957 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:14,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 105. [2019-08-05 11:11:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:14,960 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:14,960 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:14,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:14,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:14,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:14,961 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:14,961 INFO L418 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:14,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:14,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1899532418, now seen corresponding path program 443 times [2019-08-05 11:11:14,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:14,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:14,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:15,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:15,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:15,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:15,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:15,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:15,067 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:15,126 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:15,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:15,127 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:15,128 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:15,128 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:15,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:15,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 109. [2019-08-05 11:11:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:15,132 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:15,132 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:15,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:15,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:15,132 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:15,132 INFO L418 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:15,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:15,133 INFO L82 PathProgramCache]: Analyzing trace with hash 845938628, now seen corresponding path program 444 times [2019-08-05 11:11:15,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:15,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:15,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:15,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:15,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:15,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:15,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:15,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:15,247 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:15,307 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:15,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:15,307 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:15,308 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:15,308 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:15,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:15,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 101. [2019-08-05 11:11:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:15,313 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 61 [2019-08-05 11:11:15,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:15,313 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:15,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:15,313 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:15,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:15,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:15,314 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:15,314 INFO L418 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:15,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:15,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2132772862, now seen corresponding path program 445 times [2019-08-05 11:11:15,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:15,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:15,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:15,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:15,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:15,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:15,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:15,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:15,432 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 19 states. [2019-08-05 11:11:15,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:15,488 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:15,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:15,489 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:15,490 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:15,490 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:15,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:15,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 109. [2019-08-05 11:11:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:15,493 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:15,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:15,494 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:15,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:15,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:15,494 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:15,494 INFO L418 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:15,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:15,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1175067142, now seen corresponding path program 446 times [2019-08-05 11:11:15,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:15,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:15,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:15,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:15,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:15,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:15,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:15,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:15,609 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:15,678 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-08-05 11:11:15,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:15,678 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:15,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:15,679 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:15,679 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:15,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 113. [2019-08-05 11:11:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:15,682 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:15,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:15,682 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:15,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:15,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:15,683 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:15,683 INFO L418 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:15,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:15,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2066306364, now seen corresponding path program 447 times [2019-08-05 11:11:15,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:15,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:15,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:15,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:15,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:15,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:15,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:15,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:15,799 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:15,851 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-08-05 11:11:15,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:15,852 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:15,853 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:15,853 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:15,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2019-08-05 11:11:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:15,857 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:15,857 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:15,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:15,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:15,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:15,857 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:15,857 INFO L418 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:15,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:15,858 INFO L82 PathProgramCache]: Analyzing trace with hash 912405126, now seen corresponding path program 448 times [2019-08-05 11:11:15,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:15,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:15,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:15,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:15,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:15,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:15,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:15,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:15,960 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:16,021 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-08-05 11:11:16,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:16,021 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:16,022 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:16,022 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:16,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:16,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 113. [2019-08-05 11:11:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:16,026 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:16,026 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:16,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:16,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:16,026 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:16,026 INFO L418 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:16,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1108600644, now seen corresponding path program 449 times [2019-08-05 11:11:16,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:16,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:16,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:16,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:16,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:16,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:16,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:16,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:16,145 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:16,205 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:16,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:16,206 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:16,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:16,207 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:16,207 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:16,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 109. [2019-08-05 11:11:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:16,210 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:16,210 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:16,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:16,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:16,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:16,211 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:16,211 INFO L418 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:16,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:16,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1257049540, now seen corresponding path program 450 times [2019-08-05 11:11:16,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:16,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:16,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:16,353 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:16,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:16,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:16,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:16,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:16,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:16,354 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:16,415 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:16,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:16,415 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:16,416 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:16,416 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:16,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:16,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 113. [2019-08-05 11:11:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:16,419 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:16,419 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:16,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:16,419 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:16,420 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:16,420 INFO L418 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:16,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1965998916, now seen corresponding path program 451 times [2019-08-05 11:11:16,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:16,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:16,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:16,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:16,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:16,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:16,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:16,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:16,525 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:16,589 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-08-05 11:11:16,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:16,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:16,590 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:16,591 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:16,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 109. [2019-08-05 11:11:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:16,594 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:16,594 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:16,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:16,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:16,595 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:16,595 INFO L418 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:16,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:16,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1817550020, now seen corresponding path program 452 times [2019-08-05 11:11:16,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:16,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:16,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:16,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:16,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:16,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:16,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:16,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:16,703 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:16,761 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:16,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:16,762 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:16,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:16,762 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:16,762 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:16,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:16,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 113. [2019-08-05 11:11:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:16,766 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:16,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:16,766 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:16,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:16,766 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:16,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:16,767 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:16,767 INFO L418 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:16,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:16,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1423823486, now seen corresponding path program 453 times [2019-08-05 11:11:16,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:16,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:16,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:16,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:16,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:16,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:16,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:16,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:16,873 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:17,242 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2019-08-05 11:11:17,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:17,242 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:17,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:17,248 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:11:17,248 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:11:17,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:11:17,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 97. [2019-08-05 11:11:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:11:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-08-05 11:11:17,251 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 61 [2019-08-05 11:11:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:17,252 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-08-05 11:11:17,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-08-05 11:11:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:17,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:17,252 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:17,253 INFO L418 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:17,253 INFO L82 PathProgramCache]: Analyzing trace with hash 203455750, now seen corresponding path program 454 times [2019-08-05 11:11:17,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:17,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:17,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:17,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:17,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:17,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:17,362 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 19 states. [2019-08-05 11:11:17,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:17,422 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:17,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:17,423 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:17,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:17,423 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:17,423 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:17,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 85. [2019-08-05 11:11:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:11:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-08-05 11:11:17,426 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 61 [2019-08-05 11:11:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:17,427 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-08-05 11:11:17,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-08-05 11:11:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:17,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:17,427 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:17,427 INFO L418 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:17,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:17,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1820759992, now seen corresponding path program 455 times [2019-08-05 11:11:17,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:17,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:17,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:17,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:17,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:17,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:17,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:17,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:17,530 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 19 states. [2019-08-05 11:11:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:17,590 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2019-08-05 11:11:17,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:17,591 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:17,591 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:11:17,592 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:11:17,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:17,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:11:17,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 101. [2019-08-05 11:11:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:17,595 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 61 [2019-08-05 11:11:17,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:17,595 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:17,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:17,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:17,595 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:17,595 INFO L418 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:17,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:17,596 INFO L82 PathProgramCache]: Analyzing trace with hash -685097342, now seen corresponding path program 456 times [2019-08-05 11:11:17,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:17,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:17,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:17,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:17,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:17,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:17,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:17,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:17,788 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 19 states. [2019-08-05 11:11:17,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:17,841 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2019-08-05 11:11:17,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:17,842 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:17,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:17,843 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:11:17,843 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:11:17,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:17,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:11:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 113. [2019-08-05 11:11:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:17,846 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:17,847 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:17,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:17,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:17,847 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:17,847 INFO L418 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:17,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:17,847 INFO L82 PathProgramCache]: Analyzing trace with hash -767166202, now seen corresponding path program 457 times [2019-08-05 11:11:17,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:17,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:17,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:17,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:17,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:17,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:17,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:17,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:17,951 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:18,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:18,010 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:18,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:18,011 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:18,011 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:18,012 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:18,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 109. [2019-08-05 11:11:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:18,015 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:18,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:18,015 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:18,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:18,015 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:18,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:18,016 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:18,016 INFO L418 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:18,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:18,016 INFO L82 PathProgramCache]: Analyzing trace with hash -915615098, now seen corresponding path program 458 times [2019-08-05 11:11:18,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:18,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:18,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:18,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:18,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:18,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:18,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:18,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:18,213 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:18,304 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-08-05 11:11:18,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:18,305 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:18,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:18,305 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:18,305 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:18,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 113. [2019-08-05 11:11:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:18,309 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:18,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:18,309 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:18,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:18,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:18,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:18,310 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:18,310 INFO L418 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash 137978692, now seen corresponding path program 459 times [2019-08-05 11:11:18,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:18,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:18,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:18,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:18,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:18,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:18,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:18,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:18,584 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:18,645 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-08-05 11:11:18,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:18,645 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:18,646 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:18,646 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:18,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:18,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2019-08-05 11:11:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:18,650 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:18,650 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:18,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:18,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:18,651 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:18,651 INFO L418 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:18,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:18,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1738691132, now seen corresponding path program 460 times [2019-08-05 11:11:18,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:18,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:18,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:18,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:18,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:18,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:18,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:18,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:18,763 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:18,820 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:18,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:18,821 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:18,822 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:18,822 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:18,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 101. [2019-08-05 11:11:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:18,825 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 61 [2019-08-05 11:11:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:18,825 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:18,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:18,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:18,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:18,826 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:18,826 INFO L418 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:18,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:18,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1178277114, now seen corresponding path program 461 times [2019-08-05 11:11:18,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:18,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:18,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:18,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:18,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:18,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:18,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:18,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:18,932 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 19 states. [2019-08-05 11:11:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:18,991 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-08-05 11:11:18,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:18,991 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:18,992 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:18,992 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:18,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 109. [2019-08-05 11:11:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:18,996 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:18,997 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:18,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:18,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:18,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:18,998 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:18,998 INFO L418 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:18,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:18,998 INFO L82 PathProgramCache]: Analyzing trace with hash -124683324, now seen corresponding path program 462 times [2019-08-05 11:11:18,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:19,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:19,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:19,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:19,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:19,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:19,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:19,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:19,121 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:19,182 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-08-05 11:11:19,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:19,182 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:19,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:19,183 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:19,183 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:19,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:19,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2019-08-05 11:11:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:19,186 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:19,186 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:19,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:19,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:19,187 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:19,187 INFO L418 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:19,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash -273132220, now seen corresponding path program 463 times [2019-08-05 11:11:19,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:19,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:19,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:19,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:19,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:19,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:19,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:19,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:19,295 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:19,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:19,353 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:19,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:19,353 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:19,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:19,354 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:19,354 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:19,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:19,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 109. [2019-08-05 11:11:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:19,357 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:19,358 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:19,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:19,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:19,358 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:19,358 INFO L418 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:19,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:19,359 INFO L82 PathProgramCache]: Analyzing trace with hash 780461570, now seen corresponding path program 464 times [2019-08-05 11:11:19,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:19,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:19,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:19,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:19,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:19,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:19,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:19,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:19,468 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:19,524 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:19,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:19,525 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:19,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:19,526 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:19,526 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:19,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:19,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 97. [2019-08-05 11:11:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:11:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-08-05 11:11:19,529 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 61 [2019-08-05 11:11:19,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:19,529 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-08-05 11:11:19,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:19,529 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-08-05 11:11:19,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:19,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:19,530 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:19,530 INFO L418 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:19,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:19,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1669014662, now seen corresponding path program 465 times [2019-08-05 11:11:19,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:19,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:19,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:19,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:19,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:19,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:19,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:19,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:19,635 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 19 states. [2019-08-05 11:11:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:19,693 INFO L93 Difference]: Finished difference Result 165 states and 204 transitions. [2019-08-05 11:11:19,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:19,694 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:19,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:19,694 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:11:19,695 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:11:19,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:11:19,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 109. [2019-08-05 11:11:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:19,697 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:19,697 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:19,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:19,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:19,698 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:19,698 INFO L418 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:19,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:19,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1572358844, now seen corresponding path program 466 times [2019-08-05 11:11:19,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:19,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:19,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:19,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:19,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:19,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:19,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:19,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:19,817 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:19,874 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2019-08-05 11:11:19,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:19,875 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:19,875 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:11:19,875 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:11:19,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:19,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:11:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 105. [2019-08-05 11:11:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:19,879 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:19,879 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:19,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:19,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:19,880 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:19,880 INFO L418 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:19,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:19,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1720807740, now seen corresponding path program 467 times [2019-08-05 11:11:19,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:19,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:19,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:20,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:20,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:20,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:20,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:20,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:20,038 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:20,091 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:20,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:20,092 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:20,092 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:20,093 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:20,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:20,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:20,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 109. [2019-08-05 11:11:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:20,096 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:20,096 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:20,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:20,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:20,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:20,097 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:20,097 INFO L418 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:20,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:20,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1590242236, now seen corresponding path program 468 times [2019-08-05 11:11:20,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:20,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:20,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:20,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:20,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:20,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:20,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:20,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:20,206 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:20,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:20,260 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:20,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:20,261 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:20,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:20,261 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:20,261 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:20,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2019-08-05 11:11:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:20,265 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:20,265 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:20,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:20,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:20,266 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:20,266 INFO L418 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:20,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:20,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1651131270, now seen corresponding path program 469 times [2019-08-05 11:11:20,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:20,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:20,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:20,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:20,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:20,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:20,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:20,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:20,368 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:20,427 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:20,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:20,427 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:20,428 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:20,428 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:20,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:20,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:20,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 105. [2019-08-05 11:11:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:20,431 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:20,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:20,431 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:20,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:20,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:20,432 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:20,432 INFO L418 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:20,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:20,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1327580220, now seen corresponding path program 470 times [2019-08-05 11:11:20,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:20,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:20,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:20,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:20,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:20,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:20,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:20,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:20,537 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:20,600 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:20,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:20,601 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:20,601 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:20,602 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:20,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:20,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:20,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2019-08-05 11:11:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:20,605 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:20,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:20,606 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:20,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:20,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:20,606 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:20,606 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:20,606 INFO L418 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:20,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:20,607 INFO L82 PathProgramCache]: Analyzing trace with hash -667213950, now seen corresponding path program 471 times [2019-08-05 11:11:20,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:20,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:20,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:20,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:20,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:20,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:20,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:20,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:20,714 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:20,764 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:20,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:20,764 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:20,765 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:20,765 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:20,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:20,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 105. [2019-08-05 11:11:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:20,768 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 61 [2019-08-05 11:11:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:20,769 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:20,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:20,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:20,769 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:20,769 INFO L418 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:20,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:20,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1983469756, now seen corresponding path program 472 times [2019-08-05 11:11:20,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:20,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:20,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:20,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:20,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:20,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:20,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:20,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:20,885 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 19 states. [2019-08-05 11:11:20,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:20,937 INFO L93 Difference]: Finished difference Result 165 states and 204 transitions. [2019-08-05 11:11:20,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:20,937 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:20,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:20,938 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:11:20,938 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:11:20,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:11:20,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 113. [2019-08-05 11:11:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:20,942 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:20,942 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:20,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:20,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:20,942 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:20,942 INFO L418 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash -929875966, now seen corresponding path program 473 times [2019-08-05 11:11:20,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:20,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:20,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:21,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:21,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:21,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:21,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:21,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:21,049 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:21,368 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2019-08-05 11:11:21,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:21,369 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:21,370 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:11:21,370 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:11:21,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:11:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 109. [2019-08-05 11:11:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:21,373 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:21,373 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:21,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:21,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:21,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:21,374 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:21,374 INFO L418 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:21,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1078324862, now seen corresponding path program 474 times [2019-08-05 11:11:21,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:21,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:21,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:21,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:21,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:21,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:21,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:21,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:21,482 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:21,536 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2019-08-05 11:11:21,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:21,536 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:21,537 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:11:21,537 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:11:21,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:21,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:11:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 113. [2019-08-05 11:11:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:21,540 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:21,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:21,540 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:21,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:21,541 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:21,541 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:21,541 INFO L418 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:21,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1913793286, now seen corresponding path program 475 times [2019-08-05 11:11:21,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:21,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:21,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:21,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:21,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:21,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:21,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:21,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:21,647 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:21,704 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:21,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:21,704 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:21,705 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:21,705 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:21,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:21,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 109. [2019-08-05 11:11:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:21,709 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:21,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:21,709 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:21,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:21,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:21,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:21,710 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:21,710 INFO L418 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:21,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:21,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2062242182, now seen corresponding path program 476 times [2019-08-05 11:11:21,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:21,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:21,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:21,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:21,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:21,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:21,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:21,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:21,816 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:21,870 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:21,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:21,870 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:21,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:21,871 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:21,871 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:21,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:21,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:21,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 113. [2019-08-05 11:11:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:21,875 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:21,875 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:21,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:21,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:21,876 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:21,876 INFO L418 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:21,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:21,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1008648392, now seen corresponding path program 477 times [2019-08-05 11:11:21,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:21,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:21,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:21,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:21,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:21,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:21,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:21,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:21,983 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:22,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:22,038 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2019-08-05 11:11:22,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:22,038 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:22,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:22,039 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:11:22,039 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:11:22,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:22,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:11:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 97. [2019-08-05 11:11:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:11:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-08-05 11:11:22,043 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 61 [2019-08-05 11:11:22,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:22,043 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-08-05 11:11:22,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-08-05 11:11:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:22,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:22,043 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:22,043 INFO L418 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:22,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:22,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1405584898, now seen corresponding path program 478 times [2019-08-05 11:11:22,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:22,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:22,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:22,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:22,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:22,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:22,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:22,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:22,160 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 19 states. [2019-08-05 11:11:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:22,212 INFO L93 Difference]: Finished difference Result 165 states and 204 transitions. [2019-08-05 11:11:22,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:22,213 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:22,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:22,214 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:11:22,214 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:11:22,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:11:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 113. [2019-08-05 11:11:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:22,217 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 61 [2019-08-05 11:11:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:22,218 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:22,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:22,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:22,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:22,219 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:22,219 INFO L418 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:22,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:22,219 INFO L82 PathProgramCache]: Analyzing trace with hash 351991108, now seen corresponding path program 479 times [2019-08-05 11:11:22,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:22,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:22,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:22,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:22,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:22,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:22,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:22,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:22,342 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 19 states. [2019-08-05 11:11:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:22,412 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:22,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:22,413 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:22,414 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:22,414 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:22,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:22,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:22,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 109. [2019-08-05 11:11:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:22,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:22,417 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 61 [2019-08-05 11:11:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:22,417 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:22,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:22,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:22,418 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:22,418 INFO L418 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:22,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:22,418 INFO L82 PathProgramCache]: Analyzing trace with hash -24731072, now seen corresponding path program 480 times [2019-08-05 11:11:22,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:22,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:22,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:11:22,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:22,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:22,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:22,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:22,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:22,558 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 19 states. [2019-08-05 11:11:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:22,608 INFO L93 Difference]: Finished difference Result 135 states and 166 transitions. [2019-08-05 11:11:22,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:22,608 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:22,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:22,609 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:11:22,609 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:11:22,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:11:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 85. [2019-08-05 11:11:22,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:11:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-08-05 11:11:22,612 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 61 [2019-08-05 11:11:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:22,612 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-08-05 11:11:22,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-08-05 11:11:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:22,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:22,613 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:22,613 INFO L418 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:22,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:22,613 INFO L82 PathProgramCache]: Analyzing trace with hash 500440004, now seen corresponding path program 481 times [2019-08-05 11:11:22,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:22,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:22,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:22,719 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:22,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:22,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:22,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:22,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:22,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:22,720 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 19 states. [2019-08-05 11:11:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:22,779 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2019-08-05 11:11:22,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:22,779 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:22,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:22,780 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:11:22,780 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:11:22,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:11:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 89. [2019-08-05 11:11:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:11:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-08-05 11:11:22,783 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 61 [2019-08-05 11:11:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:22,783 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-08-05 11:11:22,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:22,783 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-08-05 11:11:22,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:22,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:22,784 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:22,784 INFO L418 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:22,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:22,784 INFO L82 PathProgramCache]: Analyzing trace with hash -390444022, now seen corresponding path program 482 times [2019-08-05 11:11:22,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:22,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:22,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:11:22,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:22,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:22,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:22,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:22,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:22,890 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 19 states. [2019-08-05 11:11:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:22,942 INFO L93 Difference]: Finished difference Result 147 states and 181 transitions. [2019-08-05 11:11:22,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:22,943 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:22,943 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:11:22,943 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:11:22,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:11:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 101. [2019-08-05 11:11:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:22,947 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 61 [2019-08-05 11:11:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:22,947 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:22,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:22,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:22,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:22,948 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:22,948 INFO L418 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:22,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:22,948 INFO L82 PathProgramCache]: Analyzing trace with hash -553153786, now seen corresponding path program 483 times [2019-08-05 11:11:22,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:22,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:22,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:23,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:23,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:23,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:23,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:23,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:23,072 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 19 states. [2019-08-05 11:11:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:23,124 INFO L93 Difference]: Finished difference Result 167 states and 207 transitions. [2019-08-05 11:11:23,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:23,125 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:23,125 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:11:23,126 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:11:23,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:11:23,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 93. [2019-08-05 11:11:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:11:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2019-08-05 11:11:23,129 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 61 [2019-08-05 11:11:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:23,134 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2019-08-05 11:11:23,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2019-08-05 11:11:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:23,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:23,135 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:23,135 INFO L418 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:23,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:23,135 INFO L82 PathProgramCache]: Analyzing trace with hash 663149768, now seen corresponding path program 484 times [2019-08-05 11:11:23,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:23,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:23,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:23,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:23,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:23,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:23,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:23,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:23,270 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 19 states. [2019-08-05 11:11:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:23,363 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2019-08-05 11:11:23,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:23,363 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:23,363 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:11:23,364 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:11:23,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:11:23,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 89. [2019-08-05 11:11:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:11:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-08-05 11:11:23,366 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 61 [2019-08-05 11:11:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:23,366 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-08-05 11:11:23,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-08-05 11:11:23,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:23,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:23,367 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:23,367 INFO L418 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:23,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:23,367 INFO L82 PathProgramCache]: Analyzing trace with hash 514700872, now seen corresponding path program 485 times [2019-08-05 11:11:23,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:23,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:23,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:23,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:23,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:23,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:23,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:23,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:23,618 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 19 states. [2019-08-05 11:11:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:23,677 INFO L93 Difference]: Finished difference Result 165 states and 204 transitions. [2019-08-05 11:11:23,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:23,677 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:23,678 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:11:23,678 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:11:23,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:11:23,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 93. [2019-08-05 11:11:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:11:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2019-08-05 11:11:23,682 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 61 [2019-08-05 11:11:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:23,682 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2019-08-05 11:11:23,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2019-08-05 11:11:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:23,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:23,682 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:23,682 INFO L418 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash 763102020, now seen corresponding path program 486 times [2019-08-05 11:11:23,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:23,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:23,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:23,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:23,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:23,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:23,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:23,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:23,792 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 19 states. [2019-08-05 11:11:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:23,854 INFO L93 Difference]: Finished difference Result 167 states and 207 transitions. [2019-08-05 11:11:23,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:23,854 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:23,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:23,855 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:11:23,855 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:11:23,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:11:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 101. [2019-08-05 11:11:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:23,858 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 61 [2019-08-05 11:11:23,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:23,858 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:23,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:23,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:23,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:23,859 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:23,859 INFO L418 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:23,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:23,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1568294662, now seen corresponding path program 487 times [2019-08-05 11:11:23,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:23,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:23,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:23,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:23,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:23,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:23,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:23,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:23,972 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 19 states. [2019-08-05 11:11:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:24,028 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:24,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:24,028 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:24,029 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:24,029 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:24,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:24,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 93. [2019-08-05 11:11:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:11:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2019-08-05 11:11:24,032 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 61 [2019-08-05 11:11:24,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:24,032 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2019-08-05 11:11:24,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2019-08-05 11:11:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:24,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:24,033 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:24,033 INFO L418 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:24,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:24,033 INFO L82 PathProgramCache]: Analyzing trace with hash -290491770, now seen corresponding path program 488 times [2019-08-05 11:11:24,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:24,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:24,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:24,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:24,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:24,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:24,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:24,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:24,137 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 19 states. [2019-08-05 11:11:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:24,198 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2019-08-05 11:11:24,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:24,199 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:24,200 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:11:24,200 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:11:24,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:11:24,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 89. [2019-08-05 11:11:24,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:11:24,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-08-05 11:11:24,203 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 61 [2019-08-05 11:11:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:24,203 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-08-05 11:11:24,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-08-05 11:11:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:24,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:24,204 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:24,204 INFO L418 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:24,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:24,204 INFO L82 PathProgramCache]: Analyzing trace with hash -142042874, now seen corresponding path program 489 times [2019-08-05 11:11:24,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:24,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:24,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:24,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:24,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:24,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:24,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:24,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:24,322 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 19 states. [2019-08-05 11:11:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:24,384 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2019-08-05 11:11:24,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:24,385 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:24,386 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:11:24,386 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:11:24,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:11:24,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 93. [2019-08-05 11:11:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:11:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2019-08-05 11:11:24,389 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 61 [2019-08-05 11:11:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:24,389 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2019-08-05 11:11:24,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:24,389 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2019-08-05 11:11:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:24,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:24,390 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:24,390 INFO L418 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:24,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:24,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1195636664, now seen corresponding path program 490 times [2019-08-05 11:11:24,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:24,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:24,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:24,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:24,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:24,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:24,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:24,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:24,494 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 19 states. [2019-08-05 11:11:24,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:24,551 INFO L93 Difference]: Finished difference Result 149 states and 184 transitions. [2019-08-05 11:11:24,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:24,551 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:24,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:24,552 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:11:24,552 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:11:24,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:11:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 81. [2019-08-05 11:11:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:11:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2019-08-05 11:11:24,555 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 61 [2019-08-05 11:11:24,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:24,555 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2019-08-05 11:11:24,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:24,555 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2019-08-05 11:11:24,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:24,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:24,555 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:24,556 INFO L418 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash 252038856, now seen corresponding path program 491 times [2019-08-05 11:11:24,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:24,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:24,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:24,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:24,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:24,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:24,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:24,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:24,683 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand 19 states. [2019-08-05 11:11:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:24,737 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2019-08-05 11:11:24,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:24,737 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:24,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:24,738 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:11:24,738 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:11:24,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:24,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:11:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 89. [2019-08-05 11:11:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:11:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-08-05 11:11:24,741 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 61 [2019-08-05 11:11:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:24,742 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-08-05 11:11:24,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-08-05 11:11:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:24,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:24,742 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:24,742 INFO L418 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:24,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:24,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1305632646, now seen corresponding path program 492 times [2019-08-05 11:11:24,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:24,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:24,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:24,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:24,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:24,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:24,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:24,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:24,844 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 19 states. [2019-08-05 11:11:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:24,907 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2019-08-05 11:11:24,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:24,908 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:24,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:24,909 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:11:24,909 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:11:24,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:11:24,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 85. [2019-08-05 11:11:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:11:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-08-05 11:11:24,911 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 61 [2019-08-05 11:11:24,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:24,912 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-08-05 11:11:24,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-08-05 11:11:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:24,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:24,912 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:24,912 INFO L418 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:24,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2084189756, now seen corresponding path program 493 times [2019-08-05 11:11:24,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:24,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:24,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:11:25,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:25,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:25,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:25,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:25,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:25,020 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 19 states. [2019-08-05 11:11:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:25,083 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2019-08-05 11:11:25,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:25,083 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:25,084 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:11:25,084 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:11:25,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:11:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 89. [2019-08-05 11:11:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:11:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-08-05 11:11:25,087 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 61 [2019-08-05 11:11:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:25,087 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-08-05 11:11:25,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-08-05 11:11:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:25,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:25,088 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:25,088 INFO L418 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:25,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:25,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1157183750, now seen corresponding path program 494 times [2019-08-05 11:11:25,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:25,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:11:25,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 11:11:25,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:25,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:11:25,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:11:25,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:11:25,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:25,227 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 19 states. [2019-08-05 11:11:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:25,286 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2019-08-05 11:11:25,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:11:25,286 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:11:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:25,287 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:11:25,287 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:11:25,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:11:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:11:25,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 63. [2019-08-05 11:11:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:11:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-08-05 11:11:25,291 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 61 [2019-08-05 11:11:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:25,291 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-08-05 11:11:25,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:11:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-08-05 11:11:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:25,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:25,292 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:11:25,292 INFO L418 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:25,292 INFO L82 PathProgramCache]: Analyzing trace with hash 104451040, now seen corresponding path program 9 times [2019-08-05 11:11:25,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:25,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:25,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-08-05 11:11:25,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:25,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:25,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:25,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:25,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:25,528 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 21 states. [2019-08-05 11:11:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:25,579 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2019-08-05 11:11:25,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:25,579 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:25,580 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:11:25,580 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:11:25,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:11:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-08-05 11:11:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:11:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2019-08-05 11:11:25,584 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 68 [2019-08-05 11:11:25,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:25,584 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2019-08-05 11:11:25,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:25,584 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2019-08-05 11:11:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:25,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:25,585 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:25,585 INFO L418 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:25,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:25,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2040435998, now seen corresponding path program 495 times [2019-08-05 11:11:25,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:25,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:25,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:11:25,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:25,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:25,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:25,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:25,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:25,726 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 21 states. [2019-08-05 11:11:25,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:25,780 INFO L93 Difference]: Finished difference Result 125 states and 153 transitions. [2019-08-05 11:11:25,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:25,781 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:25,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:25,782 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:11:25,782 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:11:25,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:11:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2019-08-05 11:11:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:11:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-08-05 11:11:25,785 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 68 [2019-08-05 11:11:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:25,786 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-08-05 11:11:25,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-08-05 11:11:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:25,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:25,787 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:25,787 INFO L418 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:25,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:25,787 INFO L82 PathProgramCache]: Analyzing trace with hash 186421200, now seen corresponding path program 496 times [2019-08-05 11:11:25,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:25,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:25,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:11:25,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:25,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:25,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:25,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:25,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:25,921 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 21 states. [2019-08-05 11:11:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:25,975 INFO L93 Difference]: Finished difference Result 147 states and 181 transitions. [2019-08-05 11:11:25,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:25,976 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:25,976 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:11:25,976 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:11:25,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:11:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 117. [2019-08-05 11:11:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:25,979 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:25,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:25,980 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:25,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:25,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:25,980 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:25,980 INFO L418 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:25,980 INFO L82 PathProgramCache]: Analyzing trace with hash -155988578, now seen corresponding path program 497 times [2019-08-05 11:11:25,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:25,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:25,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:11:26,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:26,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:26,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:26,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:26,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:26,137 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:26,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:26,198 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2019-08-05 11:11:26,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:26,199 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:26,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:26,200 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:11:26,200 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:11:26,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:11:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 121. [2019-08-05 11:11:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:26,203 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:26,203 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:26,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:26,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:26,204 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:26,204 INFO L418 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:26,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:26,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1749563758, now seen corresponding path program 498 times [2019-08-05 11:11:26,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:26,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:26,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:26,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:26,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:26,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:26,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:26,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:26,335 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:26,405 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2019-08-05 11:11:26,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:26,406 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:26,407 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:11:26,407 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:11:26,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:11:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 117. [2019-08-05 11:11:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:26,410 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:26,410 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:26,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:26,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:26,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:26,411 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:26,411 INFO L418 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:26,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:26,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1779996380, now seen corresponding path program 499 times [2019-08-05 11:11:26,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:26,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:26,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:26,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:26,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:26,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:26,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:26,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:26,531 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:26,595 INFO L93 Difference]: Finished difference Result 163 states and 201 transitions. [2019-08-05 11:11:26,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:26,595 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:26,596 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:11:26,596 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:11:26,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:11:26,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 109. [2019-08-05 11:11:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:26,599 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:26,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:26,599 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:26,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:26,600 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:26,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:26,600 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:26,600 INFO L418 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:26,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:26,600 INFO L82 PathProgramCache]: Analyzing trace with hash 446860818, now seen corresponding path program 500 times [2019-08-05 11:11:26,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:26,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:26,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:26,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:26,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:26,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:26,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:26,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:26,732 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:26,792 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:26,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:26,792 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:26,793 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:26,793 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:26,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 113. [2019-08-05 11:11:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:26,796 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:26,796 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:26,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:26,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:26,797 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:26,797 INFO L418 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:26,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:26,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1489124140, now seen corresponding path program 501 times [2019-08-05 11:11:26,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:26,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:26,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:26,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:26,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:26,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:26,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:26,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:26,932 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:26,995 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:26,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:26,995 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:26,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:26,996 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:26,996 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:26,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 105. [2019-08-05 11:11:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:26,999 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 68 [2019-08-05 11:11:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:26,999 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:26,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:27,000 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:27,000 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:27,000 INFO L418 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:27,000 INFO L82 PathProgramCache]: Analyzing trace with hash 763655314, now seen corresponding path program 502 times [2019-08-05 11:11:27,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:27,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:27,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:27,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:27,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:27,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:27,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:27,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:27,277 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 21 states. [2019-08-05 11:11:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:27,336 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:27,337 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:27,337 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:27,337 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:27,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 113. [2019-08-05 11:11:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:27,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:27,341 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:27,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:27,341 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:27,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:27,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:27,342 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:27,342 INFO L418 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:27,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:27,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1172329644, now seen corresponding path program 503 times [2019-08-05 11:11:27,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:27,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:27,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:27,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:27,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:27,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:27,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:27,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:27,477 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:27,544 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:27,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:27,544 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:27,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:27,545 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:27,545 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:27,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:27,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 109. [2019-08-05 11:11:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:27,548 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:27,548 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:27,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:27,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:27,549 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:27,549 INFO L418 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:27,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash -472783074, now seen corresponding path program 504 times [2019-08-05 11:11:27,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:27,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:27,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:11:27,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:27,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:27,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:27,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:27,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:27,835 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:27,889 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2019-08-05 11:11:27,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:27,890 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:27,890 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:27,891 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:27,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:27,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:27,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 117. [2019-08-05 11:11:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:27,894 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:27,894 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:27,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:27,894 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:27,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:27,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:27,895 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:27,895 INFO L418 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:27,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:27,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1463201884, now seen corresponding path program 505 times [2019-08-05 11:11:27,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:27,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:27,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:28,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:28,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:28,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:28,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:28,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:28,018 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:28,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:28,077 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2019-08-05 11:11:28,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:28,077 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:28,078 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:28,078 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:28,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:28,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2019-08-05 11:11:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:28,081 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:28,081 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:28,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:28,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:28,082 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:28,082 INFO L418 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:28,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:28,082 INFO L82 PathProgramCache]: Analyzing trace with hash -733222692, now seen corresponding path program 506 times [2019-08-05 11:11:28,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:28,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:28,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:28,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:28,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:28,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:28,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:28,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:28,209 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:28,272 INFO L93 Difference]: Finished difference Result 179 states and 221 transitions. [2019-08-05 11:11:28,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:28,273 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:28,274 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:28,274 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:28,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2019-08-05 11:11:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:28,277 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:28,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:28,277 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:28,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:28,277 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:28,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:28,278 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:28,278 INFO L418 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:28,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:28,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1202762266, now seen corresponding path program 507 times [2019-08-05 11:11:28,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:28,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:28,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:28,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:28,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:28,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:28,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:28,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:28,640 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:28,744 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2019-08-05 11:11:28,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:28,745 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:28,745 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:28,745 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:28,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2019-08-05 11:11:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:28,748 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 68 [2019-08-05 11:11:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:28,748 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:28,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:28,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:28,749 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:28,749 INFO L418 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:28,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:28,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1097449374, now seen corresponding path program 508 times [2019-08-05 11:11:28,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:28,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:28,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:11:28,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:28,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:28,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:28,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:28,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:28,902 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 21 states. [2019-08-05 11:11:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:28,962 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2019-08-05 11:11:28,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:28,963 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:28,963 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:11:28,963 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:11:28,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:11:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 117. [2019-08-05 11:11:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:28,967 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:28,967 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:28,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:28,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:28,968 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:28,968 INFO L418 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:28,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:28,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1261532964, now seen corresponding path program 509 times [2019-08-05 11:11:28,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:28,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:28,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:29,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:29,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:29,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:29,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:29,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:29,098 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:29,156 INFO L93 Difference]: Finished difference Result 195 states and 241 transitions. [2019-08-05 11:11:29,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:29,157 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:29,157 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:11:29,158 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:11:29,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:11:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 113. [2019-08-05 11:11:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:29,161 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:29,161 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:29,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:29,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:29,162 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:29,162 INFO L418 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:29,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:29,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1024094932, now seen corresponding path program 510 times [2019-08-05 11:11:29,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:29,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:29,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:29,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:29,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:29,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:29,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:29,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:29,285 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:29,352 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:29,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:29,353 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:29,353 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:29,353 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:29,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:29,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 117. [2019-08-05 11:11:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:29,356 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:29,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:29,357 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:29,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:29,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:29,357 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:29,357 INFO L418 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:29,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:29,357 INFO L82 PathProgramCache]: Analyzing trace with hash -911890026, now seen corresponding path program 511 times [2019-08-05 11:11:29,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:29,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:29,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:29,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:29,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:29,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:29,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:29,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:29,484 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:29,550 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:29,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:29,550 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:29,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:29,551 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:29,551 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:29,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 105. [2019-08-05 11:11:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:29,554 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 68 [2019-08-05 11:11:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:29,555 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:29,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:29,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:29,555 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:29,555 INFO L418 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:29,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:29,555 INFO L82 PathProgramCache]: Analyzing trace with hash -806577134, now seen corresponding path program 512 times [2019-08-05 11:11:29,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:29,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:29,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:29,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:29,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:29,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:29,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:29,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:29,697 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 21 states. [2019-08-05 11:11:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:29,754 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:29,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:29,754 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:29,755 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:29,755 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:29,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 117. [2019-08-05 11:11:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:29,759 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:29,759 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:29,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:29,759 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:29,760 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:29,760 INFO L418 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:29,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1552405204, now seen corresponding path program 513 times [2019-08-05 11:11:29,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:29,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:29,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:29,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:29,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:29,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:29,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:29,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:29,900 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:29,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:29,961 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:29,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:29,961 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:29,962 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:29,962 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:29,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 113. [2019-08-05 11:11:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:29,966 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:29,966 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:29,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:29,967 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:29,967 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:29,967 INFO L418 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:29,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:29,967 INFO L82 PathProgramCache]: Analyzing trace with hash 837009756, now seen corresponding path program 514 times [2019-08-05 11:11:29,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:29,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:29,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:30,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:30,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:30,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:30,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:30,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:30,099 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:30,163 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:30,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:30,163 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:30,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:30,164 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:30,164 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:30,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:30,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 117. [2019-08-05 11:11:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:30,169 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:30,169 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:30,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:30,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:30,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:30,170 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:30,170 INFO L418 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:30,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:30,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1521972582, now seen corresponding path program 515 times [2019-08-05 11:11:30,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:30,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:30,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:30,308 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:30,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:30,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:30,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:30,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:30,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:30,309 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:30,368 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:30,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:30,368 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:30,369 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:30,369 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:30,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:30,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 109. [2019-08-05 11:11:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:30,372 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:30,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:30,372 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:30,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:30,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:30,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:30,373 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:30,373 INFO L418 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:30,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:30,373 INFO L82 PathProgramCache]: Analyzing trace with hash 520215260, now seen corresponding path program 516 times [2019-08-05 11:11:30,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:30,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:30,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:30,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:30,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:30,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:30,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:30,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:30,499 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:30,588 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:30,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:30,588 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:30,589 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:30,589 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:30,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 117. [2019-08-05 11:11:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:30,593 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:30,593 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:30,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:30,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:30,593 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:30,593 INFO L418 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:30,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:30,594 INFO L82 PathProgramCache]: Analyzing trace with hash -546137516, now seen corresponding path program 517 times [2019-08-05 11:11:30,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:30,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:30,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:30,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:30,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:30,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:30,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:30,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:30,720 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:30,780 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:11:30,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:30,781 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:30,781 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:11:30,782 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:11:30,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:11:30,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 121. [2019-08-05 11:11:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:30,785 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:30,786 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:30,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:30,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:30,786 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:30,786 INFO L418 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:30,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1838767078, now seen corresponding path program 518 times [2019-08-05 11:11:30,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:30,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:30,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:30,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:30,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:30,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:30,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:30,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:30,918 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:30,984 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:30,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:30,984 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:30,985 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:30,985 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:30,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 117. [2019-08-05 11:11:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:30,988 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:30,988 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:30,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:30,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:30,989 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:30,989 INFO L418 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:30,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:30,989 INFO L82 PathProgramCache]: Analyzing trace with hash 259775642, now seen corresponding path program 519 times [2019-08-05 11:11:30,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:30,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:30,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:31,116 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:31,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:31,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:31,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:31,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:31,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:31,117 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:31,176 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2019-08-05 11:11:31,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:31,177 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:31,178 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:11:31,178 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:11:31,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:31,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:11:31,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 121. [2019-08-05 11:11:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:31,181 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:31,181 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:31,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:31,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:31,182 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:31,182 INFO L418 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:31,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:31,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1812844822, now seen corresponding path program 520 times [2019-08-05 11:11:31,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:31,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:31,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:31,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:31,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:31,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:31,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:31,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:31,315 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:31,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:31,379 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:11:31,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:31,380 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:31,381 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:11:31,381 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:11:31,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:11:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 113. [2019-08-05 11:11:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:31,384 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:31,385 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:31,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:31,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:31,385 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:31,385 INFO L418 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:31,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:31,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2099206696, now seen corresponding path program 521 times [2019-08-05 11:11:31,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:31,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:31,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:31,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:31,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:31,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:31,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:31,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:31,559 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:31,623 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2019-08-05 11:11:31,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:31,624 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:31,625 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:31,625 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:31,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:31,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 97. [2019-08-05 11:11:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:11:31,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-08-05 11:11:31,628 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 68 [2019-08-05 11:11:31,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:31,628 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-08-05 11:11:31,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:31,628 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-08-05 11:11:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:31,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:31,629 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:31,629 INFO L418 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:31,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:31,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1248278814, now seen corresponding path program 522 times [2019-08-05 11:11:31,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:31,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:31,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:11:31,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:31,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:31,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:31,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:31,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:31,758 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 21 states. [2019-08-05 11:11:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:31,813 INFO L93 Difference]: Finished difference Result 187 states and 231 transitions. [2019-08-05 11:11:31,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:31,814 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:31,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:31,814 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:11:31,814 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:11:31,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:31,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:11:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 113. [2019-08-05 11:11:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:31,818 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:31,818 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:31,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:31,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:31,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:31,818 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:31,819 INFO L418 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:31,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:31,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1110703524, now seen corresponding path program 523 times [2019-08-05 11:11:31,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:31,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:31,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:31,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:31,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:31,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:31,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:31,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:31,945 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:32,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:32,004 INFO L93 Difference]: Finished difference Result 195 states and 241 transitions. [2019-08-05 11:11:32,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:32,004 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:32,005 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:11:32,005 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:11:32,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:11:32,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 109. [2019-08-05 11:11:32,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:32,010 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:32,010 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:32,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:32,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:32,011 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:32,011 INFO L418 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:32,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:32,011 INFO L82 PathProgramCache]: Analyzing trace with hash 987839196, now seen corresponding path program 524 times [2019-08-05 11:11:32,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:32,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:32,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:32,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:32,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:32,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:32,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:32,167 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:32,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:32,231 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:11:32,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:32,232 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:32,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:32,233 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:32,233 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:32,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:32,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 113. [2019-08-05 11:11:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:32,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:32,236 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:32,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:32,236 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:32,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:32,236 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:32,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:32,237 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:32,237 INFO L418 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:32,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:32,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1371143142, now seen corresponding path program 525 times [2019-08-05 11:11:32,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:32,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:32,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:32,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:32,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:32,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:32,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:32,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:32,365 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:32,426 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:11:32,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:32,426 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:32,427 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:32,427 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:32,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 105. [2019-08-05 11:11:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:32,430 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 68 [2019-08-05 11:11:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:32,430 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:32,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:32,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:32,431 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:32,431 INFO L418 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:32,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:32,431 INFO L82 PathProgramCache]: Analyzing trace with hash -229343020, now seen corresponding path program 526 times [2019-08-05 11:11:32,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:32,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:32,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:32,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:32,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:32,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:32,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:32,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:32,562 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 21 states. [2019-08-05 11:11:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:32,635 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2019-08-05 11:11:32,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:32,636 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:32,637 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:11:32,637 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:11:32,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:32,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:11:32,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 113. [2019-08-05 11:11:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:32,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:32,640 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:32,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:32,641 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:32,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:32,641 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:32,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:32,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:32,641 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:32,641 INFO L418 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:32,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:32,642 INFO L82 PathProgramCache]: Analyzing trace with hash 671044700, now seen corresponding path program 527 times [2019-08-05 11:11:32,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:32,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:32,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:32,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:32,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:32,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:32,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:32,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:32,776 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:32,830 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:11:32,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:32,831 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:32,832 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:32,832 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:32,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:32,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 121. [2019-08-05 11:11:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:32,835 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:32,836 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:32,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:32,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:32,836 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:32,836 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:32,836 INFO L418 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:32,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1687937638, now seen corresponding path program 528 times [2019-08-05 11:11:32,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:32,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:32,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:32,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:32,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:32,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:32,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:32,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:32,955 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:33,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:33,052 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:11:33,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:33,052 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:33,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:33,053 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:33,053 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:33,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:33,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 117. [2019-08-05 11:11:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:33,057 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:33,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:33,057 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:33,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:33,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:33,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:33,058 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:33,058 INFO L418 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:33,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:33,058 INFO L82 PathProgramCache]: Analyzing trace with hash 410605082, now seen corresponding path program 529 times [2019-08-05 11:11:33,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:33,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:33,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:33,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:33,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:33,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:33,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:33,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:33,188 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:33,251 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:11:33,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:33,251 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:33,252 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:33,252 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:33,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:33,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 121. [2019-08-05 11:11:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:33,256 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:33,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:33,256 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:33,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:33,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:33,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:33,256 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:33,257 INFO L418 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:33,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:33,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1948377256, now seen corresponding path program 530 times [2019-08-05 11:11:33,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:33,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:33,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:33,386 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:33,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:33,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:33,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:33,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:33,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:33,387 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:33,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:33,451 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:11:33,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:33,452 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:33,452 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:33,453 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:33,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 109. [2019-08-05 11:11:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:33,456 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:33,457 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:33,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:33,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:33,457 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:33,457 INFO L418 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:33,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2053690148, now seen corresponding path program 531 times [2019-08-05 11:11:33,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:33,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:33,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:33,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:33,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:33,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:33,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:33,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:33,912 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:33,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:33,975 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:11:33,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:33,975 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:33,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:33,976 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:33,976 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:33,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:33,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 121. [2019-08-05 11:11:33,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:33,981 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:33,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:33,981 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:33,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:33,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:33,982 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:33,982 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:33,982 INFO L418 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:33,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:33,982 INFO L82 PathProgramCache]: Analyzing trace with hash -117705190, now seen corresponding path program 532 times [2019-08-05 11:11:33,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:33,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:33,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:34,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:34,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:34,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:34,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:34,173 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:34,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:34,238 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:11:34,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:34,238 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:34,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:34,239 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:34,239 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:34,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 117. [2019-08-05 11:11:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:34,243 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:34,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:34,243 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:34,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:34,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:34,244 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:34,244 INFO L418 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:34,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:34,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1980837530, now seen corresponding path program 533 times [2019-08-05 11:11:34,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:34,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:34,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:34,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:34,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:34,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:34,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:34,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:34,378 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:34,452 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:11:34,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:34,453 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:34,454 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:34,454 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:34,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:34,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:34,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 121. [2019-08-05 11:11:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:34,457 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:34,457 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:34,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:34,458 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:34,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:34,458 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:34,458 INFO L418 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:34,458 INFO L82 PathProgramCache]: Analyzing trace with hash -378144808, now seen corresponding path program 534 times [2019-08-05 11:11:34,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:34,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:34,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:34,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:34,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:34,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:34,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:34,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:34,593 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:34,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:34,646 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:11:34,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:34,647 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:34,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:34,647 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:34,648 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:34,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:34,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 113. [2019-08-05 11:11:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:34,651 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:34,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:34,651 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:34,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:34,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:34,652 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:34,652 INFO L418 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:34,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1664043034, now seen corresponding path program 535 times [2019-08-05 11:11:34,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:34,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:34,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:34,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:34,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:34,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:34,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:34,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:34,784 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:34,867 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:11:34,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:34,868 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:34,868 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:34,868 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:34,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:34,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:34,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 121. [2019-08-05 11:11:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:34,872 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:34,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:34,872 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:34,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:34,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:34,873 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:34,873 INFO L418 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:34,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:34,873 INFO L82 PathProgramCache]: Analyzing trace with hash -694939304, now seen corresponding path program 536 times [2019-08-05 11:11:34,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:34,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:34,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:34,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:34,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:34,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:34,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:34,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:34,998 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:35,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:35,057 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:11:35,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:35,058 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:35,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:35,059 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:35,059 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:35,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:35,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 117. [2019-08-05 11:11:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:35,062 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:35,063 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:35,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:35,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:35,063 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:35,063 INFO L418 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:35,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:35,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1403603416, now seen corresponding path program 537 times [2019-08-05 11:11:35,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:35,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:35,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:35,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:35,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:35,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:35,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:35,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:35,194 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:35,256 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2019-08-05 11:11:35,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:35,257 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:35,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:35,258 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:11:35,258 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:11:35,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:11:35,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 121. [2019-08-05 11:11:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:35,261 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:35,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:35,261 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:35,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:35,261 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:35,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:35,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:35,262 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:35,262 INFO L418 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:35,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:35,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2129639318, now seen corresponding path program 538 times [2019-08-05 11:11:35,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:35,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:35,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:35,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:35,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:35,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:35,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:35,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:35,401 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:35,467 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:11:35,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:35,468 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:35,469 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:35,469 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:35,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 117. [2019-08-05 11:11:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:35,472 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:35,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:35,473 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:35,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:35,473 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:35,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:35,473 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:35,473 INFO L418 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:35,474 INFO L82 PathProgramCache]: Analyzing trace with hash -955378922, now seen corresponding path program 539 times [2019-08-05 11:11:35,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:35,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:35,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:35,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:35,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:35,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:35,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:35,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:35,592 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:35,655 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2019-08-05 11:11:35,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:35,656 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:35,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:35,656 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:35,657 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:11:35,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:35,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:11:35,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 97. [2019-08-05 11:11:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:11:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-08-05 11:11:35,660 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 68 [2019-08-05 11:11:35,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:35,660 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-08-05 11:11:35,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:35,660 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-08-05 11:11:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:35,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:35,661 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:35,661 INFO L418 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:35,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:35,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1958326686, now seen corresponding path program 540 times [2019-08-05 11:11:35,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:35,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:35,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:11:35,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:35,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:35,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:35,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:35,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:35,793 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 21 states. [2019-08-05 11:11:35,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:35,847 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2019-08-05 11:11:35,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:35,847 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:35,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:35,848 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:35,848 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:35,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:35,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 117. [2019-08-05 11:11:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:35,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:35,852 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:35,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:35,852 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:35,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:35,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:35,853 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:35,853 INFO L418 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:35,853 INFO L82 PathProgramCache]: Analyzing trace with hash -400655652, now seen corresponding path program 541 times [2019-08-05 11:11:35,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:35,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:35,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:35,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:35,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:35,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:35,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:35,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:35,979 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:36,040 INFO L93 Difference]: Finished difference Result 195 states and 241 transitions. [2019-08-05 11:11:36,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:36,040 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:36,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:36,041 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:11:36,041 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:11:36,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:36,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:11:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 113. [2019-08-05 11:11:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:36,045 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:36,045 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:36,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:36,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:36,046 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:36,046 INFO L418 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:36,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1697887068, now seen corresponding path program 542 times [2019-08-05 11:11:36,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:36,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:36,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:36,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:36,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:36,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:36,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:36,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:36,181 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:36,235 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:11:36,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:36,235 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:36,236 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:36,236 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:36,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 117. [2019-08-05 11:11:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:36,239 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:36,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:36,240 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:36,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:36,240 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:36,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:36,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:36,240 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:36,240 INFO L418 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:36,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:36,240 INFO L82 PathProgramCache]: Analyzing trace with hash -661095270, now seen corresponding path program 543 times [2019-08-05 11:11:36,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:36,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:36,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:36,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:36,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:36,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:36,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:36,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:36,361 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:36,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:36,420 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:11:36,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:36,420 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:36,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:36,421 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:36,421 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:36,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:36,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 109. [2019-08-05 11:11:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:36,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:36,425 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:36,425 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:36,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:36,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:36,425 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:36,425 INFO L418 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:36,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:36,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1381092572, now seen corresponding path program 544 times [2019-08-05 11:11:36,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:36,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:36,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:36,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:36,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:36,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:36,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:36,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:36,555 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:36,619 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:11:36,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:36,620 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:36,621 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:36,621 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:36,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:36,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 117. [2019-08-05 11:11:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:36,625 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:36,625 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:36,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:36,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:36,626 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:36,626 INFO L418 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:36,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:36,626 INFO L82 PathProgramCache]: Analyzing trace with hash -977889766, now seen corresponding path program 545 times [2019-08-05 11:11:36,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:36,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:36,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:36,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:36,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:36,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:36,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:36,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:36,773 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:36,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:36,836 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:11:36,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:36,837 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:36,837 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:36,838 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:36,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:36,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 113. [2019-08-05 11:11:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:36,841 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:36,841 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:36,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:36,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:36,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:36,842 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:36,842 INFO L418 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:36,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:36,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1120652954, now seen corresponding path program 546 times [2019-08-05 11:11:36,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:36,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:36,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:36,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:36,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:36,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:36,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:36,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:36,960 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:37,020 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:11:37,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:37,021 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:37,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:37,022 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:37,022 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:37,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:37,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 117. [2019-08-05 11:11:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:37,025 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:37,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:37,025 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:37,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:37,025 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:37,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:37,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:37,026 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:37,026 INFO L418 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:37,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:37,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1238329384, now seen corresponding path program 547 times [2019-08-05 11:11:37,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:37,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:37,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:37,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:37,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:37,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:37,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:37,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:37,167 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:37,225 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:11:37,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:37,225 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:37,226 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:37,226 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:37,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:37,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 105. [2019-08-05 11:11:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:37,230 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 68 [2019-08-05 11:11:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:37,230 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:37,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:37,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:37,230 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:37,231 INFO L418 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:37,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:37,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1343642276, now seen corresponding path program 548 times [2019-08-05 11:11:37,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:37,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:37,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:37,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:37,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:37,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:37,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:37,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:37,356 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 21 states. [2019-08-05 11:11:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:37,414 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:37,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:37,414 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:37,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:37,415 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:37,415 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:37,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 117. [2019-08-05 11:11:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:37,419 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:37,419 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:37,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:37,419 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:37,419 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:37,419 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:37,419 INFO L418 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash 592342682, now seen corresponding path program 549 times [2019-08-05 11:11:37,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:37,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:37,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:37,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:37,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:37,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:37,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:37,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:37,541 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:37,603 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:11:37,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:37,603 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:37,604 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:37,604 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:37,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 113. [2019-08-05 11:11:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:37,607 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:37,607 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:37,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:37,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:37,608 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:37,608 INFO L418 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:37,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:37,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1604081894, now seen corresponding path program 550 times [2019-08-05 11:11:37,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:37,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:37,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:37,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:37,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:37,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:37,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:37,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:37,748 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:37,812 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:11:37,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:37,812 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:37,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:37,813 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:11:37,813 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:11:37,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:37,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:11:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 117. [2019-08-05 11:11:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:37,817 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:37,817 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:37,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:37,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:37,817 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:37,818 INFO L418 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:37,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:37,818 INFO L82 PathProgramCache]: Analyzing trace with hash 331903064, now seen corresponding path program 551 times [2019-08-05 11:11:37,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:37,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:37,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:37,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:37,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:37,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:37,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:37,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:37,941 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:38,005 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:11:38,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:38,006 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:38,007 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:11:38,007 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:11:38,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:11:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 109. [2019-08-05 11:11:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:38,011 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:38,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:38,011 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:38,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:38,011 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:38,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:38,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:38,012 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:38,012 INFO L418 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:38,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1920876390, now seen corresponding path program 552 times [2019-08-05 11:11:38,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:38,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:38,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:38,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:38,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:38,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:38,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:38,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:38,140 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:38,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:38,200 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:11:38,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:38,201 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:38,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:38,202 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:11:38,202 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:11:38,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:11:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 117. [2019-08-05 11:11:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:38,205 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:38,205 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:38,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:38,206 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:38,206 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:38,206 INFO L418 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:38,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:38,206 INFO L82 PathProgramCache]: Analyzing trace with hash 15108568, now seen corresponding path program 553 times [2019-08-05 11:11:38,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:38,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:38,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:38,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:38,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:38,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:38,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:38,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:38,330 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:38,396 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:11:38,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:38,397 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:38,397 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:11:38,398 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:11:38,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:38,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:11:38,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 113. [2019-08-05 11:11:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:38,401 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:38,401 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:38,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:38,402 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:38,402 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:38,402 INFO L418 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:38,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:38,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2113651288, now seen corresponding path program 554 times [2019-08-05 11:11:38,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:38,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:38,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:38,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:38,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:38,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:38,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:38,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:38,537 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:38,614 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:11:38,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:38,615 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:38,616 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:38,616 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:38,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 117. [2019-08-05 11:11:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:38,619 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:38,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:38,619 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:38,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:38,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:38,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:38,620 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:38,620 INFO L418 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:38,620 INFO L82 PathProgramCache]: Analyzing trace with hash -245331050, now seen corresponding path program 555 times [2019-08-05 11:11:38,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:38,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:38,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:39,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:39,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:39,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:39,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:39,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:39,014 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:39,074 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:39,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:39,074 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:39,075 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:39,075 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:39,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 101. [2019-08-05 11:11:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:39,079 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 68 [2019-08-05 11:11:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:39,079 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:39,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:39,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:39,080 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:39,080 INFO L418 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:39,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1192812836, now seen corresponding path program 556 times [2019-08-05 11:11:39,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:39,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:39,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:39,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:39,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:39,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:39,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:39,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:39,222 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 21 states. [2019-08-05 11:11:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:39,276 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:39,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:39,277 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:39,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:39,278 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:39,278 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:39,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 117. [2019-08-05 11:11:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:39,281 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:39,281 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:39,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:39,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:39,282 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:39,282 INFO L418 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:39,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:39,282 INFO L82 PathProgramCache]: Analyzing trace with hash 743172122, now seen corresponding path program 557 times [2019-08-05 11:11:39,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:39,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:39,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:39,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:39,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:39,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:39,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:39,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:39,409 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:39,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:39,469 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:39,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:39,469 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:39,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:39,470 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:39,470 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:39,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:39,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 113. [2019-08-05 11:11:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:39,474 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:39,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:39,474 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:39,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:39,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:39,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:39,475 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:39,475 INFO L418 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:39,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1453252454, now seen corresponding path program 558 times [2019-08-05 11:11:39,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:39,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:39,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:39,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:39,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:39,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:39,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:39,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:39,601 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:39,659 INFO L93 Difference]: Finished difference Result 191 states and 237 transitions. [2019-08-05 11:11:39,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:39,659 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:39,660 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:11:39,660 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:11:39,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:11:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 117. [2019-08-05 11:11:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:39,663 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:39,664 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:39,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:39,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:39,664 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:39,664 INFO L418 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:39,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:39,665 INFO L82 PathProgramCache]: Analyzing trace with hash 482732504, now seen corresponding path program 559 times [2019-08-05 11:11:39,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:39,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:39,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:39,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:39,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:39,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:39,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:39,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:39,793 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:39,860 INFO L93 Difference]: Finished difference Result 191 states and 237 transitions. [2019-08-05 11:11:39,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:39,860 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:39,861 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:11:39,861 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:11:39,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:39,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:11:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 109. [2019-08-05 11:11:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:39,864 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:39,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:39,865 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:39,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:39,865 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:39,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:39,865 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:39,865 INFO L418 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:39,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:39,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1770046950, now seen corresponding path program 560 times [2019-08-05 11:11:39,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:39,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:39,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:39,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:39,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:39,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:39,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:39,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:39,996 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:40,060 INFO L93 Difference]: Finished difference Result 191 states and 237 transitions. [2019-08-05 11:11:40,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:40,061 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:40,062 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:11:40,062 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:11:40,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:11:40,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 117. [2019-08-05 11:11:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:40,065 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:40,066 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:40,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:40,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:40,066 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:40,066 INFO L418 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:40,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:40,066 INFO L82 PathProgramCache]: Analyzing trace with hash 165938008, now seen corresponding path program 561 times [2019-08-05 11:11:40,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:40,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:40,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:40,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:40,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:40,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:40,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:40,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:40,196 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:40,256 INFO L93 Difference]: Finished difference Result 191 states and 237 transitions. [2019-08-05 11:11:40,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:40,257 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:40,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:40,258 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:11:40,258 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:11:40,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:40,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:11:40,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 113. [2019-08-05 11:11:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:40,261 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:40,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:40,261 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:40,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:40,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:40,262 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:40,262 INFO L418 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:40,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:40,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2030486568, now seen corresponding path program 562 times [2019-08-05 11:11:40,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:40,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:40,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:40,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:40,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:40,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:40,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:40,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:40,399 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:40,463 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:40,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:40,464 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:40,464 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:40,465 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:40,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 117. [2019-08-05 11:11:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:40,468 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:40,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:40,468 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:40,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:40,468 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:40,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:40,468 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:40,469 INFO L418 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:40,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:40,469 INFO L82 PathProgramCache]: Analyzing trace with hash -94501610, now seen corresponding path program 563 times [2019-08-05 11:11:40,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:40,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:40,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:40,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:40,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:40,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:40,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:40,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:40,597 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:40,662 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:40,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:40,662 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:40,663 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:40,663 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:40,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:40,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 105. [2019-08-05 11:11:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:40,666 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 68 [2019-08-05 11:11:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:40,667 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:40,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:40,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:40,667 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:40,667 INFO L418 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:40,667 INFO L82 PathProgramCache]: Analyzing trace with hash -199814502, now seen corresponding path program 564 times [2019-08-05 11:11:40,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:40,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:40,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:40,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:40,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:40,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:40,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:40,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:40,797 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 21 states. [2019-08-05 11:11:40,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:40,855 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:40,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:40,855 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:40,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:40,856 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:40,856 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:40,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 117. [2019-08-05 11:11:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:40,860 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:40,860 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:40,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:40,860 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:40,860 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:40,860 INFO L418 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:40,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:40,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1736170456, now seen corresponding path program 565 times [2019-08-05 11:11:40,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:40,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:40,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:40,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:40,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:40,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:40,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:40,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:40,987 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:41,051 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:41,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:41,051 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:41,052 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:41,052 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:41,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:41,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 113. [2019-08-05 11:11:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:41,055 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:41,055 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:41,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:41,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:41,056 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:41,056 INFO L418 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:41,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:41,056 INFO L82 PathProgramCache]: Analyzing trace with hash -460254120, now seen corresponding path program 566 times [2019-08-05 11:11:41,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:41,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:41,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:41,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:41,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:41,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:41,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:41,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:41,189 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:41,250 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:41,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:41,250 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:41,251 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:41,251 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:41,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 117. [2019-08-05 11:11:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:41,254 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:41,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:41,254 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:41,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:41,255 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:41,255 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:41,255 INFO L418 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:41,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:41,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1475730838, now seen corresponding path program 567 times [2019-08-05 11:11:41,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:41,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:41,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:41,387 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:41,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:41,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:41,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:41,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:41,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:41,387 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:41,466 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:41,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:41,467 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:41,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:41,467 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:41,467 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:41,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 109. [2019-08-05 11:11:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:41,471 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:41,471 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:41,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:41,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:41,472 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:41,472 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:41,472 INFO L418 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:41,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:41,472 INFO L82 PathProgramCache]: Analyzing trace with hash -777048616, now seen corresponding path program 568 times [2019-08-05 11:11:41,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:41,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:41,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:41,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:41,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:41,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:41,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:41,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:41,595 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:41,661 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:41,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:41,662 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:41,663 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:41,663 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:41,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:41,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 117. [2019-08-05 11:11:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:41,666 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:41,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:41,666 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:41,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:41,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:41,667 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:41,667 INFO L418 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:41,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:41,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1158936342, now seen corresponding path program 569 times [2019-08-05 11:11:41,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:41,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:41,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:41,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:41,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:41,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:41,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:41,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:41,797 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:41,863 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:41,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:41,863 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:41,864 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:41,864 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:41,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 113. [2019-08-05 11:11:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:41,868 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:41,868 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:41,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:41,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:41,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:41,869 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:41,869 INFO L418 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:41,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:41,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1037488234, now seen corresponding path program 570 times [2019-08-05 11:11:41,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:41,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:41,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:42,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:42,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:42,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:42,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:42,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:42,009 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:42,070 INFO L93 Difference]: Finished difference Result 179 states and 221 transitions. [2019-08-05 11:11:42,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:42,070 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:42,071 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:42,071 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:42,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2019-08-05 11:11:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:42,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:42,074 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:42,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:42,074 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:42,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:42,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:42,075 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:42,075 INFO L418 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:42,075 INFO L82 PathProgramCache]: Analyzing trace with hash 31096598, now seen corresponding path program 571 times [2019-08-05 11:11:42,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:42,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:42,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:42,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:42,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:42,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:42,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:42,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:42,205 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:42,265 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:11:42,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:42,265 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:42,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:42,266 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:42,266 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:42,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:42,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 121. [2019-08-05 11:11:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:42,271 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:42,271 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:42,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:42,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:42,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:42,271 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:42,272 INFO L418 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:42,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:42,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1904888360, now seen corresponding path program 572 times [2019-08-05 11:11:42,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:42,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:42,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:42,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:42,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:42,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:42,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:42,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:42,409 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:42,469 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:11:42,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:42,470 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:42,471 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:42,471 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:42,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:42,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 105. [2019-08-05 11:11:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:42,474 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 68 [2019-08-05 11:11:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:42,474 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:42,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:42,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:42,475 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:42,475 INFO L418 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:42,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:42,475 INFO L82 PathProgramCache]: Analyzing trace with hash -957406574, now seen corresponding path program 573 times [2019-08-05 11:11:42,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:42,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:42,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:42,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:42,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:42,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:42,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:42,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:42,604 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 21 states. [2019-08-05 11:11:42,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:42,662 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:42,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:42,663 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:42,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:42,664 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:42,664 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:42,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:42,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 121. [2019-08-05 11:11:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:42,668 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:42,668 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:42,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:42,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:42,669 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:42,669 INFO L418 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1401575764, now seen corresponding path program 574 times [2019-08-05 11:11:42,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:42,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:42,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:42,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:42,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:42,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:42,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:42,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:42,799 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:42,859 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:11:42,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:42,860 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:42,861 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:42,861 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:42,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 117. [2019-08-05 11:11:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:42,864 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:42,864 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:42,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:42,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:42,865 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:42,865 INFO L418 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:42,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:42,865 INFO L82 PathProgramCache]: Analyzing trace with hash -696966956, now seen corresponding path program 575 times [2019-08-05 11:11:42,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:42,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:42,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:42,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:42,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:42,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:42,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:42,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:42,998 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:43,063 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:11:43,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:43,063 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:43,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:43,064 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:43,064 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:43,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:43,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:43,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 121. [2019-08-05 11:11:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:43,067 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:43,068 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:43,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:43,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:43,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:43,068 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:43,068 INFO L418 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:43,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:43,069 INFO L82 PathProgramCache]: Analyzing trace with hash 898496724, now seen corresponding path program 576 times [2019-08-05 11:11:43,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:43,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:43,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:43,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:43,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:43,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:43,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:43,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:43,199 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:43,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:43,261 INFO L93 Difference]: Finished difference Result 167 states and 206 transitions. [2019-08-05 11:11:43,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:43,261 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:43,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:43,262 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:11:43,262 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:11:43,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:11:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 97. [2019-08-05 11:11:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:11:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-08-05 11:11:43,266 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 68 [2019-08-05 11:11:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:43,266 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-08-05 11:11:43,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-08-05 11:11:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:43,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:43,266 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:43,266 INFO L418 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:43,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:43,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1705080034, now seen corresponding path program 577 times [2019-08-05 11:11:43,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:43,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:43,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:11:43,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:43,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:43,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:43,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:43,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:43,394 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 21 states. [2019-08-05 11:11:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:43,453 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2019-08-05 11:11:43,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:43,453 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:43,454 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:11:43,454 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:11:43,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:43,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:11:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 121. [2019-08-05 11:11:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:43,457 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:43,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:43,458 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:43,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:43,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:43,458 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:43,458 INFO L418 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:43,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1662015382, now seen corresponding path program 578 times [2019-08-05 11:11:43,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:43,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:43,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:43,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:43,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:43,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:43,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:43,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:43,612 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:43,705 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:11:43,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:43,705 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:43,706 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:11:43,706 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:11:43,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:11:43,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 113. [2019-08-05 11:11:43,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:43,709 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:43,709 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:43,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:43,709 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:43,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:43,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:43,710 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:43,710 INFO L418 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:43,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:43,710 INFO L82 PathProgramCache]: Analyzing trace with hash 230904924, now seen corresponding path program 579 times [2019-08-05 11:11:43,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:43,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:43,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:44,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:44,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:44,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:44,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:44,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:44,008 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:44,066 INFO L93 Difference]: Finished difference Result 179 states and 221 transitions. [2019-08-05 11:11:44,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:44,067 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:44,068 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:44,068 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:44,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 109. [2019-08-05 11:11:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:44,071 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:44,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:44,071 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:44,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:44,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:44,072 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:44,072 INFO L418 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:44,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1965519652, now seen corresponding path program 580 times [2019-08-05 11:11:44,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:44,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:44,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:44,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:44,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:44,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:44,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:44,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:44,207 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:44,271 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:44,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:44,271 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:44,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:44,272 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:44,272 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:44,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 113. [2019-08-05 11:11:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:44,276 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:44,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:44,276 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:44,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:44,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:44,277 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:44,277 INFO L418 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:44,278 INFO L82 PathProgramCache]: Analyzing trace with hash -29534694, now seen corresponding path program 581 times [2019-08-05 11:11:44,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:44,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:44,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:44,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:44,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:44,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:44,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:44,419 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:44,479 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:44,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:44,479 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:44,480 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:44,480 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:44,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 105. [2019-08-05 11:11:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:44,484 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 68 [2019-08-05 11:11:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:44,484 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:44,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:44,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:44,485 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:44,485 INFO L418 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:44,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:44,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2012653148, now seen corresponding path program 582 times [2019-08-05 11:11:44,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:44,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:44,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:44,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:44,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:44,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:44,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:44,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:44,636 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 21 states. [2019-08-05 11:11:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:44,694 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:44,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:44,694 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:44,695 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:44,695 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:44,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:44,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:44,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 113. [2019-08-05 11:11:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:44,699 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:44,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:44,699 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:44,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:44,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:44,700 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:44,700 INFO L418 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:44,700 INFO L82 PathProgramCache]: Analyzing trace with hash -346329190, now seen corresponding path program 583 times [2019-08-05 11:11:44,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:44,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:44,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:44,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:44,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:44,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:44,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:44,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:44,878 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:44,941 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:44,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:44,941 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:44,942 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:44,942 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:44,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:44,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 109. [2019-08-05 11:11:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:44,945 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:44,946 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:44,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:44,946 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:44,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:44,946 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:44,946 INFO L418 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:44,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:44,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1752213530, now seen corresponding path program 584 times [2019-08-05 11:11:44,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:44,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:44,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:45,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:45,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:45,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:45,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:45,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:45,075 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:45,134 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:45,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:45,135 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:45,135 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:45,135 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:45,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 113. [2019-08-05 11:11:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:45,138 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:45,138 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:45,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:45,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:45,139 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:45,139 INFO L418 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:45,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:45,139 INFO L82 PathProgramCache]: Analyzing trace with hash -606768808, now seen corresponding path program 585 times [2019-08-05 11:11:45,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:45,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:45,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:45,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:45,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:45,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:45,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:45,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:45,265 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:45,332 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:45,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:45,333 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:45,334 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:45,334 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:45,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:45,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 101. [2019-08-05 11:11:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:45,338 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 68 [2019-08-05 11:11:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:45,339 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:45,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:45,339 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:45,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:45,339 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:45,340 INFO L418 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:45,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:45,340 INFO L82 PathProgramCache]: Analyzing trace with hash -712081700, now seen corresponding path program 586 times [2019-08-05 11:11:45,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:45,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:45,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:45,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:45,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:45,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:45,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:45,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:45,468 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 21 states. [2019-08-05 11:11:45,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:45,537 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:45,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:45,537 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:45,538 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:45,538 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:45,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 113. [2019-08-05 11:11:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:45,541 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:45,541 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:45,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:45,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:45,542 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:45,542 INFO L418 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:45,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:45,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1223903258, now seen corresponding path program 587 times [2019-08-05 11:11:45,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:45,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:45,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:45,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:45,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:45,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:45,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:45,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:45,669 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:45,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:45,730 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:45,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:45,731 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:45,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:45,732 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:45,732 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:45,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 109. [2019-08-05 11:11:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:45,735 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:45,735 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:45,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:45,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:45,736 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:45,736 INFO L418 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:45,736 INFO L82 PathProgramCache]: Analyzing trace with hash -972521318, now seen corresponding path program 588 times [2019-08-05 11:11:45,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:45,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:45,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:45,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:45,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:45,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:45,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:45,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:45,894 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:45,961 INFO L93 Difference]: Finished difference Result 191 states and 237 transitions. [2019-08-05 11:11:45,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:45,962 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:45,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:45,962 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:11:45,963 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:11:45,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:45,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:11:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 113. [2019-08-05 11:11:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:45,966 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:45,966 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:45,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:45,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:45,966 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:45,966 INFO L418 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:45,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:45,967 INFO L82 PathProgramCache]: Analyzing trace with hash 963463640, now seen corresponding path program 589 times [2019-08-05 11:11:45,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:45,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:45,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:46,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:46,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:46,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:46,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:46,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:46,089 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:46,149 INFO L93 Difference]: Finished difference Result 191 states and 237 transitions. [2019-08-05 11:11:46,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:46,150 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:46,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:46,150 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:11:46,151 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:11:46,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:11:46,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 105. [2019-08-05 11:11:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:46,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:46,154 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 68 [2019-08-05 11:11:46,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:46,154 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:46,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:46,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:46,155 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:46,155 INFO L418 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:46,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:46,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1289315814, now seen corresponding path program 590 times [2019-08-05 11:11:46,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:46,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:46,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:46,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:46,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:46,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:46,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:46,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:46,279 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 21 states. [2019-08-05 11:11:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:46,338 INFO L93 Difference]: Finished difference Result 191 states and 237 transitions. [2019-08-05 11:11:46,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:46,338 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:46,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:46,339 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:11:46,339 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:11:46,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:46,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:11:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 113. [2019-08-05 11:11:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:46,343 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:46,343 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:46,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:46,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:46,344 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:46,344 INFO L418 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash -380172460, now seen corresponding path program 591 times [2019-08-05 11:11:46,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:46,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:46,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:46,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:46,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:46,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:46,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:46,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:46,472 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:46,533 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:11:46,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:46,534 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:46,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:46,534 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:11:46,535 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:11:46,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:46,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:11:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 121. [2019-08-05 11:11:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:46,538 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:46,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:46,538 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:46,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:46,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:46,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:46,539 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:46,539 INFO L418 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:46,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:46,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1978809878, now seen corresponding path program 592 times [2019-08-05 11:11:46,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:46,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:46,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:46,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:46,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:46,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:46,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:46,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:46,670 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:46,732 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:11:46,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:46,732 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:46,733 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:11:46,733 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:11:46,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:11:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 117. [2019-08-05 11:11:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:46,736 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:46,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:46,737 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:46,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:46,737 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:46,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:46,737 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:46,737 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:46,737 INFO L418 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:46,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:46,738 INFO L82 PathProgramCache]: Analyzing trace with hash 646669144, now seen corresponding path program 593 times [2019-08-05 11:11:46,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:46,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:46,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:46,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:46,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:46,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:46,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:46,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:46,862 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:46,926 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:11:46,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:46,926 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:46,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:46,927 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:11:46,927 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:11:46,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:11:46,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 113. [2019-08-05 11:11:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:46,932 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:46,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:46,932 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:46,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:46,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:46,933 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:46,933 INFO L418 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:46,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:46,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1549755432, now seen corresponding path program 594 times [2019-08-05 11:11:46,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:46,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:46,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:47,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:47,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:47,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:47,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:47,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:47,169 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:47,234 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:11:47,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:47,235 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:47,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:47,235 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:47,235 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:47,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:47,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 117. [2019-08-05 11:11:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:47,240 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:47,241 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:47,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:47,241 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:47,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:47,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:47,241 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:47,242 INFO L418 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:47,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:47,242 INFO L82 PathProgramCache]: Analyzing trace with hash 386229526, now seen corresponding path program 595 times [2019-08-05 11:11:47,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:47,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:47,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:47,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:47,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:47,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:47,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:47,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:47,403 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:47,461 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:11:47,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:47,462 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:47,463 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:11:47,463 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:11:47,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:11:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 101. [2019-08-05 11:11:47,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:47,467 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 68 [2019-08-05 11:11:47,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:47,467 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:47,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:47,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:47,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:47,468 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:47,468 INFO L418 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:47,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:47,468 INFO L82 PathProgramCache]: Analyzing trace with hash -561252260, now seen corresponding path program 596 times [2019-08-05 11:11:47,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:47,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:47,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:47,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:47,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:47,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:47,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:47,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:47,618 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 21 states. [2019-08-05 11:11:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:47,676 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2019-08-05 11:11:47,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:47,677 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:47,677 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:11:47,678 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:11:47,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:11:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 117. [2019-08-05 11:11:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:47,681 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:47,681 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:47,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:47,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:47,682 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:47,682 INFO L418 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:47,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:47,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1374732698, now seen corresponding path program 597 times [2019-08-05 11:11:47,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:47,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:47,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:47,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:47,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:47,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:47,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:47,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:47,807 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:47,872 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:47,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:47,872 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:47,873 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:47,873 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:47,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:47,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 113. [2019-08-05 11:11:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:47,877 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:47,877 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:47,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:47,877 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:47,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:47,878 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:47,878 INFO L418 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:47,878 INFO L82 PathProgramCache]: Analyzing trace with hash -821691878, now seen corresponding path program 598 times [2019-08-05 11:11:47,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:47,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:47,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:48,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:48,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:48,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:48,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:48,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:48,001 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:48,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:48,061 INFO L93 Difference]: Finished difference Result 191 states and 237 transitions. [2019-08-05 11:11:48,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:48,061 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:48,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:48,062 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:11:48,062 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:11:48,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:48,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:11:48,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 117. [2019-08-05 11:11:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:48,066 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:48,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:48,066 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:48,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:48,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:48,066 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:48,067 INFO L418 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:48,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:48,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1114293080, now seen corresponding path program 599 times [2019-08-05 11:11:48,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:48,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:48,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:48,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:48,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:48,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:48,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:48,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:48,200 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:48,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:48,270 INFO L93 Difference]: Finished difference Result 191 states and 237 transitions. [2019-08-05 11:11:48,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:48,271 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:48,272 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:11:48,272 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:11:48,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:11:48,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 109. [2019-08-05 11:11:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:48,275 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:48,275 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:48,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:48,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:48,276 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:48,276 INFO L418 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:48,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1138486374, now seen corresponding path program 600 times [2019-08-05 11:11:48,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:48,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:48,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:48,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:48,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:48,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:48,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:48,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:48,401 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:48,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:48,464 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2019-08-05 11:11:48,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:48,464 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:48,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:48,465 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:11:48,465 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:11:48,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:11:48,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 117. [2019-08-05 11:11:48,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:48,468 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:48,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:48,469 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:48,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:48,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:48,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:48,469 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:48,469 INFO L418 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:48,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:48,470 INFO L82 PathProgramCache]: Analyzing trace with hash 797498584, now seen corresponding path program 601 times [2019-08-05 11:11:48,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:48,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:48,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:48,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:48,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:48,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:48,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:48,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:48,602 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:48,670 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2019-08-05 11:11:48,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:48,670 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:48,671 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:11:48,671 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:11:48,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:11:48,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 113. [2019-08-05 11:11:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:48,674 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:48,675 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:48,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:48,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:48,675 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:48,675 INFO L418 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:48,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:48,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1398925992, now seen corresponding path program 602 times [2019-08-05 11:11:48,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:48,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:48,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:48,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:48,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:48,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:48,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:48,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:48,802 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:48,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:48,907 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2019-08-05 11:11:48,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:48,907 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:48,908 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:11:48,908 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:11:48,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:48,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:11:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 117. [2019-08-05 11:11:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:48,912 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:48,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:48,912 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:48,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:48,912 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:48,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:48,912 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:48,913 INFO L418 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:48,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:48,913 INFO L82 PathProgramCache]: Analyzing trace with hash -119732842, now seen corresponding path program 603 times [2019-08-05 11:11:48,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:48,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:48,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:49,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:49,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:49,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:49,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:49,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:49,187 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:49,258 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:11:49,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:49,258 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:49,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:49,259 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:11:49,259 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:11:49,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:49,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:11:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 121. [2019-08-05 11:11:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:49,270 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:49,270 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:49,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:49,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:49,271 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:49,271 INFO L418 AbstractCegarLoop]: === Iteration 622 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:49,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2055717800, now seen corresponding path program 604 times [2019-08-05 11:11:49,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:49,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:49,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:49,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:49,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:49,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:49,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:49,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:49,403 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:49,463 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:11:49,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:49,463 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:49,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:49,464 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:11:49,464 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:11:49,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:11:49,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 109. [2019-08-05 11:11:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:49,467 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:49,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:49,468 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:49,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:49,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:49,468 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:49,468 INFO L418 AbstractCegarLoop]: === Iteration 623 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:49,469 INFO L82 PathProgramCache]: Analyzing trace with hash 537058966, now seen corresponding path program 605 times [2019-08-05 11:11:49,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:49,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:49,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:49,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:49,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:49,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:49,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:49,594 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:49,656 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-08-05 11:11:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:49,657 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:49,657 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:49,657 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:49,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 97. [2019-08-05 11:11:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:11:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-08-05 11:11:49,661 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 68 [2019-08-05 11:11:49,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:49,661 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-08-05 11:11:49,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-08-05 11:11:49,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:49,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:49,661 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:49,661 INFO L418 AbstractCegarLoop]: === Iteration 624 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:49,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:49,662 INFO L82 PathProgramCache]: Analyzing trace with hash 431746074, now seen corresponding path program 606 times [2019-08-05 11:11:49,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:49,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:49,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:49,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:49,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:49,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:49,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:49,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:49,792 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 21 states. [2019-08-05 11:11:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:49,855 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-08-05 11:11:49,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:49,855 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:49,856 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:49,856 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:49,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 109. [2019-08-05 11:11:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:49,860 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:49,860 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:49,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:49,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:49,860 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:49,860 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:49,860 INFO L418 AbstractCegarLoop]: === Iteration 625 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:49,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:49,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1927236264, now seen corresponding path program 607 times [2019-08-05 11:11:49,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:49,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:49,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:49,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:49,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:49,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:49,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:49,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:49,983 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:50,051 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-08-05 11:11:50,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:50,052 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:50,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:50,052 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:50,053 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:50,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 105. [2019-08-05 11:11:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:50,056 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 68 [2019-08-05 11:11:50,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:50,056 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:50,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:50,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:50,057 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:50,057 INFO L418 AbstractCegarLoop]: === Iteration 626 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:50,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:50,057 INFO L82 PathProgramCache]: Analyzing trace with hash 171306456, now seen corresponding path program 608 times [2019-08-05 11:11:50,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:50,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:50,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:50,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:50,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:50,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:50,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:50,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:50,187 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 21 states. [2019-08-05 11:11:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:50,254 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-08-05 11:11:50,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:50,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:50,255 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:50,256 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:50,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:50,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 109. [2019-08-05 11:11:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:50,259 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:50,259 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:50,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:50,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:50,260 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:50,260 INFO L418 AbstractCegarLoop]: === Iteration 627 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:50,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:50,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2107291414, now seen corresponding path program 609 times [2019-08-05 11:11:50,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:50,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:50,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:50,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:50,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:50,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:50,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:50,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:50,400 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:50,472 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-08-05 11:11:50,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:50,473 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:50,474 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:50,474 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:50,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 101. [2019-08-05 11:11:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:50,477 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 68 [2019-08-05 11:11:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:50,477 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:50,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:50,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:50,478 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:50,478 INFO L418 AbstractCegarLoop]: === Iteration 628 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:50,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:50,478 INFO L82 PathProgramCache]: Analyzing trace with hash -145488040, now seen corresponding path program 610 times [2019-08-05 11:11:50,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:50,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:50,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:50,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:50,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:50,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:50,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:50,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:50,608 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 21 states. [2019-08-05 11:11:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:50,675 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:50,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:50,675 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:50,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:50,676 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:50,676 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:50,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:50,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 109. [2019-08-05 11:11:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:50,680 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:50,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:50,680 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:50,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:50,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:50,681 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:50,681 INFO L418 AbstractCegarLoop]: === Iteration 629 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:50,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:50,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1950404908, now seen corresponding path program 611 times [2019-08-05 11:11:50,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:50,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:50,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:50,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:50,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:50,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:50,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:50,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:50,813 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:50,876 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:11:50,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:50,877 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:50,878 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:50,878 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:50,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 121. [2019-08-05 11:11:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:50,881 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:50,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:50,881 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:50,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:50,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:50,882 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:50,882 INFO L418 AbstractCegarLoop]: === Iteration 630 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:50,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:50,882 INFO L82 PathProgramCache]: Analyzing trace with hash 408577430, now seen corresponding path program 612 times [2019-08-05 11:11:50,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:50,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:50,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:51,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:51,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:51,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:51,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:51,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:51,022 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:51,095 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:11:51,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:51,096 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:51,097 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:11:51,097 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:11:51,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:11:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 117. [2019-08-05 11:11:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:51,100 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:51,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:51,101 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:51,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:51,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:51,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:51,101 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:51,101 INFO L418 AbstractCegarLoop]: === Iteration 631 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:51,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:51,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496918, now seen corresponding path program 613 times [2019-08-05 11:11:51,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:51,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:51,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:51,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:51,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:51,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:51,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:51,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:51,225 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:51,290 INFO L93 Difference]: Finished difference Result 191 states and 237 transitions. [2019-08-05 11:11:51,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:51,291 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:51,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:51,291 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:11:51,292 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:11:51,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:11:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 113. [2019-08-05 11:11:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:51,295 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:51,295 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:51,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:51,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:51,296 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:51,296 INFO L418 AbstractCegarLoop]: === Iteration 632 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:51,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash -405927658, now seen corresponding path program 614 times [2019-08-05 11:11:51,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:51,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:51,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:51,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:51,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:51,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:51,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:51,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:51,423 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:51,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:51,490 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:51,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:51,490 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:51,491 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:51,491 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:51,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:51,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:51,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 117. [2019-08-05 11:11:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:51,494 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:51,494 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:51,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:51,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:51,495 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:51,495 INFO L418 AbstractCegarLoop]: === Iteration 633 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:51,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1530057300, now seen corresponding path program 615 times [2019-08-05 11:11:51,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:51,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:51,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:51,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:51,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:51,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:51,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:51,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:51,627 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:51,693 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2019-08-05 11:11:51,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:51,693 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:51,694 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:11:51,694 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:11:51,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:11:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 97. [2019-08-05 11:11:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:11:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-08-05 11:11:51,699 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 68 [2019-08-05 11:11:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:51,699 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-08-05 11:11:51,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-08-05 11:11:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:51,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:51,700 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:51,700 INFO L418 AbstractCegarLoop]: === Iteration 634 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:51,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:51,700 INFO L82 PathProgramCache]: Analyzing trace with hash 148795612, now seen corresponding path program 616 times [2019-08-05 11:11:51,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:51,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:51,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:51,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:51,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:51,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:51,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:51,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:51,827 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 21 states. [2019-08-05 11:11:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:51,893 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:51,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:51,894 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:51,894 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:51,895 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:51,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 117. [2019-08-05 11:11:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:51,898 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:51,898 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:51,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:51,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:51,898 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:51,898 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:51,899 INFO L418 AbstractCegarLoop]: === Iteration 635 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:51,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:51,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2084780570, now seen corresponding path program 617 times [2019-08-05 11:11:51,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:51,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:51,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:52,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:52,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:52,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:52,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:52,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:52,064 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:52,131 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:52,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:52,132 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:52,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:52,132 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:52,132 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:52,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 113. [2019-08-05 11:11:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:52,136 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:52,136 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:52,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:52,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:52,136 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:52,137 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:52,137 INFO L418 AbstractCegarLoop]: === Iteration 636 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:52,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:52,137 INFO L82 PathProgramCache]: Analyzing trace with hash -111644006, now seen corresponding path program 618 times [2019-08-05 11:11:52,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:52,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:52,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:52,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:52,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:52,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:52,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:52,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:52,262 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:52,322 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2019-08-05 11:11:52,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:52,323 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:52,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:52,323 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:11:52,323 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:11:52,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:11:52,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 117. [2019-08-05 11:11:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:52,327 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:52,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:52,327 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:52,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:52,327 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:52,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:52,328 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:52,328 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:52,328 INFO L418 AbstractCegarLoop]: === Iteration 637 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:52,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:52,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1689965290, now seen corresponding path program 619 times [2019-08-05 11:11:52,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:52,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:52,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:52,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:52,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:52,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:52,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:52,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:52,454 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:52,523 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-08-05 11:11:52,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:52,523 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:52,524 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:11:52,524 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:11:52,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:52,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:11:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 121. [2019-08-05 11:11:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:52,528 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:52,529 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:52,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:52,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:52,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:52,529 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:52,529 INFO L418 AbstractCegarLoop]: === Iteration 638 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:52,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:52,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1824340952, now seen corresponding path program 620 times [2019-08-05 11:11:52,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:52,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:52,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:52,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:52,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:52,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:52,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:52,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:52,665 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:52,734 INFO L93 Difference]: Finished difference Result 191 states and 237 transitions. [2019-08-05 11:11:52,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:52,735 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:52,736 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:11:52,736 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:11:52,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:11:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 113. [2019-08-05 11:11:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:52,739 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:52,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:52,740 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:52,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:52,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:52,740 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:52,740 INFO L418 AbstractCegarLoop]: === Iteration 639 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:52,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:52,740 INFO L82 PathProgramCache]: Analyzing trace with hash -428438502, now seen corresponding path program 621 times [2019-08-05 11:11:52,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:52,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:52,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:52,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:52,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:52,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:52,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:52,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:52,903 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:52,971 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2019-08-05 11:11:52,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:52,972 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:52,973 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:11:52,973 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:11:52,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:11:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 121. [2019-08-05 11:11:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:52,977 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:52,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:52,977 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:52,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:52,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:52,978 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:52,978 INFO L418 AbstractCegarLoop]: === Iteration 640 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:52,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:52,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1507546456, now seen corresponding path program 622 times [2019-08-05 11:11:52,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:52,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:52,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:53,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:53,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:53,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:53,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:53,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:53,132 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:53,209 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2019-08-05 11:11:53,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:53,209 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:53,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:53,210 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:11:53,210 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:11:53,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:53,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:11:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 117. [2019-08-05 11:11:53,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:53,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:53,214 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:53,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:53,215 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:53,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:53,215 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:53,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:53,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:53,215 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:53,216 INFO L418 AbstractCegarLoop]: === Iteration 641 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:53,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:53,216 INFO L82 PathProgramCache]: Analyzing trace with hash 669017048, now seen corresponding path program 623 times [2019-08-05 11:11:53,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:53,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:53,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:53,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:53,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:53,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:53,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:53,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:53,341 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:53,404 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2019-08-05 11:11:53,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:53,405 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:53,405 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:11:53,405 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:11:53,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:11:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 109. [2019-08-05 11:11:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:53,409 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:53,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:53,409 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:53,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:53,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:53,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:53,410 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:53,410 INFO L418 AbstractCegarLoop]: === Iteration 642 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash -688878120, now seen corresponding path program 624 times [2019-08-05 11:11:53,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:53,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:53,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:53,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:53,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:53,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:53,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:53,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:53,535 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:53,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:53,604 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-08-05 11:11:53,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:53,605 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:53,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:53,605 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:53,606 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:53,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 113. [2019-08-05 11:11:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:53,609 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:53,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:53,609 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:53,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:53,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:53,610 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:53,610 INFO L418 AbstractCegarLoop]: === Iteration 643 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:53,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:53,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1373170794, now seen corresponding path program 625 times [2019-08-05 11:11:53,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:53,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:53,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:53,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:53,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:53,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:53,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:53,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:53,797 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:53,868 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:11:53,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:53,869 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:53,869 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:11:53,870 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:11:53,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:53,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:11:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 121. [2019-08-05 11:11:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:53,874 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:53,874 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:53,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:53,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:53,874 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:53,875 INFO L418 AbstractCegarLoop]: === Iteration 644 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:53,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:53,875 INFO L82 PathProgramCache]: Analyzing trace with hash 985811544, now seen corresponding path program 626 times [2019-08-05 11:11:53,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:53,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:53,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:54,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:54,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:54,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:54,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:54,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:54,193 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:54,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:54,292 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:11:54,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:54,292 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:54,293 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:11:54,293 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:11:54,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:11:54,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 117. [2019-08-05 11:11:54,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:54,297 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:54,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:54,297 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:54,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:54,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:54,298 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:54,298 INFO L418 AbstractCegarLoop]: === Iteration 645 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:54,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:54,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1247106838, now seen corresponding path program 627 times [2019-08-05 11:11:54,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:54,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:54,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:54,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:54,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:54,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:54,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:54,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:54,426 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:54,495 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:54,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:54,495 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:54,496 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:54,496 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:54,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 105. [2019-08-05 11:11:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-08-05 11:11:54,501 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 68 [2019-08-05 11:11:54,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:54,501 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-08-05 11:11:54,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-08-05 11:11:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:54,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:54,501 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:54,502 INFO L418 AbstractCegarLoop]: === Iteration 646 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:54,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:54,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1141793946, now seen corresponding path program 628 times [2019-08-05 11:11:54,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:54,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:54,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:54,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:54,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:54,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:54,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:54,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:54,632 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 21 states. [2019-08-05 11:11:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:54,702 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:54,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:54,703 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:54,704 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:54,704 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:54,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 117. [2019-08-05 11:11:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:54,707 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:54,707 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:54,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:54,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:54,708 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:54,708 INFO L418 AbstractCegarLoop]: === Iteration 647 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:54,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:54,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1217188392, now seen corresponding path program 629 times [2019-08-05 11:11:54,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:54,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:54,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:54,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:54,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:54,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:54,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:54,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:54,830 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:54,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:54,896 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:54,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:54,896 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:54,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:54,897 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:54,897 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:54,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2019-08-05 11:11:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:54,900 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:54,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:54,901 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:54,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:54,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:54,901 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:54,901 INFO L418 AbstractCegarLoop]: === Iteration 648 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:54,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash 881354328, now seen corresponding path program 630 times [2019-08-05 11:11:54,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:54,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:54,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:55,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:55,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:55,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:55,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:55,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:55,047 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:55,123 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:55,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:55,123 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:55,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:55,124 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:55,124 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:55,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 117. [2019-08-05 11:11:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:55,128 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:55,128 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:55,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:55,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:55,129 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:55,129 INFO L418 AbstractCegarLoop]: === Iteration 649 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:55,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1477628010, now seen corresponding path program 631 times [2019-08-05 11:11:55,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:55,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:55,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:55,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:55,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:55,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:55,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:55,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:55,255 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:55,326 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:55,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:55,327 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:55,327 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:55,328 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:55,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:55,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 109. [2019-08-05 11:11:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:55,331 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:55,331 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:55,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:55,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:55,332 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:55,332 INFO L418 AbstractCegarLoop]: === Iteration 650 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:55,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:55,332 INFO L82 PathProgramCache]: Analyzing trace with hash 564559832, now seen corresponding path program 632 times [2019-08-05 11:11:55,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:55,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:55,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:55,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:55,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:55,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:55,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:55,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:55,488 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:55,563 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2019-08-05 11:11:55,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:55,564 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:55,565 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:11:55,565 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:11:55,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:55,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:11:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 117. [2019-08-05 11:11:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:55,568 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:55,569 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:55,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:55,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:55,569 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:55,569 INFO L418 AbstractCegarLoop]: === Iteration 651 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:55,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1794422506, now seen corresponding path program 633 times [2019-08-05 11:11:55,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:55,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:55,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:55,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:55,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:55,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:55,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:55,693 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:55,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:55,763 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2019-08-05 11:11:55,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:55,763 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:55,764 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:11:55,764 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:11:55,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:11:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 113. [2019-08-05 11:11:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:55,768 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:55,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:55,768 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:55,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:55,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:55,768 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:55,769 INFO L418 AbstractCegarLoop]: === Iteration 652 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:55,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:55,769 INFO L82 PathProgramCache]: Analyzing trace with hash 304120214, now seen corresponding path program 634 times [2019-08-05 11:11:55,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:55,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:55,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:55,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:55,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:55,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:55,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:55,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:55,890 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:55,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:55,959 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:55,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:55,960 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:55,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:55,960 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:55,961 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:55,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:55,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 117. [2019-08-05 11:11:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:55,964 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:55,964 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:55,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:55,965 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:55,965 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:55,965 INFO L418 AbstractCegarLoop]: === Iteration 653 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:55,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:55,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2054862124, now seen corresponding path program 635 times [2019-08-05 11:11:55,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:55,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:55,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:56,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:56,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:56,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:56,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:56,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:56,102 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:56,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:56,164 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:56,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:56,165 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:56,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:56,165 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:56,166 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:56,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:56,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 101. [2019-08-05 11:11:56,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:11:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-08-05 11:11:56,169 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 68 [2019-08-05 11:11:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:56,169 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-08-05 11:11:56,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-08-05 11:11:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:56,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:56,170 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:56,170 INFO L418 AbstractCegarLoop]: === Iteration 654 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:56,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:56,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1292623386, now seen corresponding path program 636 times [2019-08-05 11:11:56,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:56,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:56,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:56,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:56,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:56,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:56,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:56,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:56,367 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 21 states. [2019-08-05 11:11:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:56,439 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:56,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:56,439 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:56,440 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:56,440 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:56,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:56,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 117. [2019-08-05 11:11:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:56,444 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:56,444 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:56,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:56,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:56,445 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:56,445 INFO L418 AbstractCegarLoop]: === Iteration 655 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:56,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:56,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1066358952, now seen corresponding path program 637 times [2019-08-05 11:11:56,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:56,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:56,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:56,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:56,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:56,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:56,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:56,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:56,568 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:56,641 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:56,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:56,641 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:56,642 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:56,642 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:56,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 113. [2019-08-05 11:11:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:56,645 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:56,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:56,645 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:56,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:56,645 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:56,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:56,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:56,646 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:56,646 INFO L418 AbstractCegarLoop]: === Iteration 656 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:56,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:56,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1032183768, now seen corresponding path program 638 times [2019-08-05 11:11:56,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:56,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:56,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:56,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:56,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:56,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:56,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:56,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:56,794 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:56,862 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2019-08-05 11:11:56,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:56,862 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:56,863 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:11:56,863 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:11:56,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:11:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2019-08-05 11:11:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:56,867 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:56,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:56,867 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:56,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:56,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:56,868 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:56,868 INFO L418 AbstractCegarLoop]: === Iteration 657 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:56,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:56,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1112731176, now seen corresponding path program 639 times [2019-08-05 11:11:56,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:56,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:56,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:57,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:57,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:57,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:57,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:57,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:57,008 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:57,096 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:11:57,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:57,097 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:57,097 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:11:57,098 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:11:57,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:11:57,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 121. [2019-08-05 11:11:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:57,101 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:57,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:57,101 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:57,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:57,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:57,102 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:57,102 INFO L418 AbstractCegarLoop]: === Iteration 658 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:57,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1326798570, now seen corresponding path program 640 times [2019-08-05 11:11:57,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:57,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:57,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:57,224 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:57,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:57,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:57,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:57,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:57,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:57,224 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:57,289 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:11:57,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:57,289 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:57,290 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:11:57,290 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:11:57,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:11:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2019-08-05 11:11:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:57,293 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:57,293 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:57,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:57,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:57,294 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:57,294 INFO L418 AbstractCegarLoop]: === Iteration 659 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:57,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:57,294 INFO L82 PathProgramCache]: Analyzing trace with hash 715389272, now seen corresponding path program 641 times [2019-08-05 11:11:57,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:57,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:57,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:57,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:57,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:57,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:57,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:57,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:57,420 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:57,483 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2019-08-05 11:11:57,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:57,483 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:57,484 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:11:57,484 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:11:57,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:11:57,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 121. [2019-08-05 11:11:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:57,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:57,488 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:57,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:57,488 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:57,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:57,488 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:57,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:57,489 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:57,489 INFO L418 AbstractCegarLoop]: === Iteration 660 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:57,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1643593066, now seen corresponding path program 642 times [2019-08-05 11:11:57,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:57,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:57,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:57,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:57,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:57,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:57,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:57,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:57,619 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:57,688 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2019-08-05 11:11:57,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:57,688 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:57,689 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:11:57,689 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:11:57,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:11:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 117. [2019-08-05 11:11:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:57,693 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:57,693 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:57,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:57,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:57,693 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:57,694 INFO L418 AbstractCegarLoop]: === Iteration 661 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:57,694 INFO L82 PathProgramCache]: Analyzing trace with hash 454949654, now seen corresponding path program 643 times [2019-08-05 11:11:57,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:57,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:57,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:57,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:57,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:57,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:57,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:57,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:57,832 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:57,901 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:11:57,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:57,902 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:57,902 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:57,903 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:57,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 121. [2019-08-05 11:11:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:57,906 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:57,906 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:57,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:57,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:57,907 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:57,907 INFO L418 AbstractCegarLoop]: === Iteration 662 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:57,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:57,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1904032684, now seen corresponding path program 644 times [2019-08-05 11:11:57,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:57,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:57,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:58,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:58,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:58,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:58,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:58,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:58,030 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:58,092 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:58,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:58,092 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:58,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:58,093 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:58,093 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:58,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:58,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:58,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 109. [2019-08-05 11:11:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2019-08-05 11:11:58,096 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 68 [2019-08-05 11:11:58,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:58,096 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2019-08-05 11:11:58,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2019-08-05 11:11:58,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:58,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:58,097 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:58,097 INFO L418 AbstractCegarLoop]: === Iteration 663 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:58,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:58,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2009345576, now seen corresponding path program 645 times [2019-08-05 11:11:58,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:58,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:58,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:58,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:58,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:58,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:58,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:58,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:58,222 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 21 states. [2019-08-05 11:11:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:58,293 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:58,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:58,293 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:58,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:58,294 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:58,294 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:58,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 121. [2019-08-05 11:11:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:58,298 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:58,298 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:58,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:58,298 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:58,298 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:58,298 INFO L418 AbstractCegarLoop]: === Iteration 664 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:58,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:58,299 INFO L82 PathProgramCache]: Analyzing trace with hash -73360618, now seen corresponding path program 646 times [2019-08-05 11:11:58,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:58,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:58,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:58,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:58,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:58,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:58,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:58,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:58,430 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:58,499 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2019-08-05 11:11:58,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:58,499 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:58,500 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:11:58,500 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:11:58,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:58,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:11:58,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 117. [2019-08-05 11:11:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:58,503 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:58,503 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:58,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:58,504 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:58,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:58,504 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:58,504 INFO L418 AbstractCegarLoop]: === Iteration 665 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:58,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:58,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2025182102, now seen corresponding path program 647 times [2019-08-05 11:11:58,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:58,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:58,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:58,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:58,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:58,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:58,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:58,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:58,628 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:58,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:58,705 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:58,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:58,705 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:58,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:58,706 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:58,706 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:58,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 121. [2019-08-05 11:11:58,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:58,709 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:58,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:58,709 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:58,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:58,709 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:58,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:58,710 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:58,710 INFO L418 AbstractCegarLoop]: === Iteration 666 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:58,710 INFO L82 PathProgramCache]: Analyzing trace with hash -333800236, now seen corresponding path program 648 times [2019-08-05 11:11:58,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:58,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:58,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:58,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:58,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:58,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:58,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:58,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:58,839 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:58,927 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-08-05 11:11:58,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:58,928 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:58,928 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:58,929 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:58,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:58,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 113. [2019-08-05 11:11:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2019-08-05 11:11:58,932 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 68 [2019-08-05 11:11:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:58,932 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2019-08-05 11:11:58,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2019-08-05 11:11:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:58,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:58,933 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:58,933 INFO L418 AbstractCegarLoop]: === Iteration 667 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:58,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:58,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1708387606, now seen corresponding path program 649 times [2019-08-05 11:11:58,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:58,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:58,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:11:59,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:59,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:59,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:59,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:59,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:59,064 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand 21 states. [2019-08-05 11:11:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:59,176 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-08-05 11:11:59,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:59,177 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:59,177 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:59,177 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:11:59,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:11:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 121. [2019-08-05 11:11:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:59,180 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:59,180 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:59,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:59,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:59,181 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:59,181 INFO L418 AbstractCegarLoop]: === Iteration 668 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash -650594732, now seen corresponding path program 650 times [2019-08-05 11:11:59,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:59,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:59,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:59,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:59,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:59,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:59,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:59,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:59,540 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:59,606 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-08-05 11:11:59,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:59,606 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:59,607 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:59,607 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:59,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 117. [2019-08-05 11:11:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-08-05 11:11:59,611 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 68 [2019-08-05 11:11:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:59,611 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-08-05 11:11:59,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-08-05 11:11:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:59,612 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:59,612 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:59,612 INFO L418 AbstractCegarLoop]: === Iteration 669 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:59,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:59,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1447947988, now seen corresponding path program 651 times [2019-08-05 11:11:59,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:59,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:59,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:11:59,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:59,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:59,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:59,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:59,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:59,737 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 21 states. [2019-08-05 11:11:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:59,809 INFO L93 Difference]: Finished difference Result 163 states and 201 transitions. [2019-08-05 11:11:59,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:59,809 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:59,810 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:11:59,810 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:11:59,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:11:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 121. [2019-08-05 11:11:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-08-05 11:11:59,813 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 68 [2019-08-05 11:11:59,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:59,813 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-08-05 11:11:59,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:11:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-08-05 11:11:59,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:59,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:59,814 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:59,814 INFO L418 AbstractCegarLoop]: === Iteration 670 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:59,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:59,814 INFO L82 PathProgramCache]: Analyzing trace with hash -911034350, now seen corresponding path program 652 times [2019-08-05 11:11:59,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:59,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:11:59,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:11:59,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:59,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:11:59,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:11:59,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:11:59,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:11:59,939 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 21 states. [2019-08-05 11:11:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:59,998 INFO L93 Difference]: Finished difference Result 147 states and 181 transitions. [2019-08-05 11:11:59,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:11:59,998 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:11:59,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:59,999 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:11:59,999 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:12:00,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:00,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:12:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 95. [2019-08-05 11:12:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:12:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-08-05 11:12:00,002 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 68 [2019-08-05 11:12:00,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:00,002 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-08-05 11:12:00,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-08-05 11:12:00,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:00,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:00,003 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:00,003 INFO L418 AbstractCegarLoop]: === Iteration 671 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:00,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:00,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1201906590, now seen corresponding path program 653 times [2019-08-05 11:12:00,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:00,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:00,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:12:00,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:00,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:00,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:00,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:00,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:00,141 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 21 states. [2019-08-05 11:12:00,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:00,202 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2019-08-05 11:12:00,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:00,202 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:00,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:00,203 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:12:00,203 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:12:00,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:12:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 119. [2019-08-05 11:12:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:00,207 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:00,207 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:00,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:00,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:00,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:00,207 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:00,208 INFO L418 AbstractCegarLoop]: === Iteration 672 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:00,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:00,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1157075748, now seen corresponding path program 654 times [2019-08-05 11:12:00,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:00,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:00,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:00,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:00,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:00,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:00,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:00,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:00,350 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:00,413 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2019-08-05 11:12:00,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:00,414 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:00,415 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:12:00,415 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:12:00,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:00,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:12:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 115. [2019-08-05 11:12:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:00,418 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:00,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:00,418 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:00,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:00,419 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:00,419 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:00,419 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:00,419 INFO L418 AbstractCegarLoop]: === Iteration 673 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:00,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:00,419 INFO L82 PathProgramCache]: Analyzing trace with hash 941466972, now seen corresponding path program 655 times [2019-08-05 11:12:00,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:00,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:00,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:00,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:00,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:00,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:00,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:00,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:00,543 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:00,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:00,611 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:00,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:00,611 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:00,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:00,612 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:00,612 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:00,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:00,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 119. [2019-08-05 11:12:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:00,616 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:00,616 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:00,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:00,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:00,617 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:00,617 INFO L418 AbstractCegarLoop]: === Iteration 674 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:00,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:00,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1417515366, now seen corresponding path program 656 times [2019-08-05 11:12:00,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:00,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:00,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:00,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:00,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:00,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:00,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:00,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:00,739 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:00,807 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:00,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:00,808 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:00,808 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:00,809 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:00,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 111. [2019-08-05 11:12:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:00,812 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:00,812 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:00,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:00,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:00,813 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:00,813 INFO L418 AbstractCegarLoop]: === Iteration 675 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:00,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash 624672476, now seen corresponding path program 657 times [2019-08-05 11:12:00,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:00,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:00,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:00,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:00,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:00,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:00,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:00,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:00,946 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:01,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:01,010 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:01,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:01,010 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:01,011 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:01,011 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:01,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:01,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 119. [2019-08-05 11:12:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:01,015 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:01,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:01,015 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:01,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:01,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:01,016 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:01,016 INFO L418 AbstractCegarLoop]: === Iteration 676 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:01,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:01,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1734309862, now seen corresponding path program 658 times [2019-08-05 11:12:01,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:01,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:01,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:01,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:01,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:01,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:01,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:01,173 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:01,254 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:01,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:01,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:01,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:01,256 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:01,256 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:01,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:01,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 115. [2019-08-05 11:12:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:01,259 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:01,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:01,260 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:01,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:01,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:01,260 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:01,260 INFO L418 AbstractCegarLoop]: === Iteration 677 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:01,260 INFO L82 PathProgramCache]: Analyzing trace with hash 364232858, now seen corresponding path program 659 times [2019-08-05 11:12:01,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:01,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:01,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:01,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:01,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:01,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:01,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:01,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:01,383 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:01,450 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:01,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:01,451 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:01,451 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:01,452 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:01,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:01,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 119. [2019-08-05 11:12:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:01,455 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:01,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:01,455 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:01,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:01,455 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:01,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:01,456 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:01,456 INFO L418 AbstractCegarLoop]: === Iteration 678 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:01,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:01,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1994749480, now seen corresponding path program 660 times [2019-08-05 11:12:01,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:01,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:01,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:01,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:01,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:01,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:01,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:01,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:01,584 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:01,647 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:01,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:01,648 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:01,649 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:01,649 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:01,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 107. [2019-08-05 11:12:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:12:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:12:01,652 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:12:01,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:01,652 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:12:01,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:12:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:01,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:01,653 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:01,653 INFO L418 AbstractCegarLoop]: === Iteration 679 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:01,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:01,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2100062372, now seen corresponding path program 661 times [2019-08-05 11:12:01,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:01,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:01,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:01,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:01,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:01,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:01,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:01,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:01,857 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:12:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:01,920 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:01,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:01,921 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:01,921 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:01,922 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:01,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:01,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:01,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 119. [2019-08-05 11:12:01,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:01,924 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:01,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:01,925 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:01,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:01,925 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:01,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:01,925 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:01,925 INFO L418 AbstractCegarLoop]: === Iteration 680 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:01,926 INFO L82 PathProgramCache]: Analyzing trace with hash -164077414, now seen corresponding path program 662 times [2019-08-05 11:12:01,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:01,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:01,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:02,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:02,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:02,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:02,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:02,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:02,056 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:02,121 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:02,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:02,121 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:02,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:02,122 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:02,122 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:02,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 115. [2019-08-05 11:12:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:02,126 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:02,126 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:02,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:02,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:02,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:02,127 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:02,127 INFO L418 AbstractCegarLoop]: === Iteration 681 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:02,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:02,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1934465306, now seen corresponding path program 663 times [2019-08-05 11:12:02,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:02,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:02,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:02,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:02,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:02,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:02,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:02,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:02,273 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:02,341 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-08-05 11:12:02,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:02,342 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:02,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:02,342 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:02,343 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:02,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:02,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 119. [2019-08-05 11:12:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:02,347 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:02,347 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:02,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:02,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:02,347 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:02,347 INFO L418 AbstractCegarLoop]: === Iteration 682 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash -424517032, now seen corresponding path program 664 times [2019-08-05 11:12:02,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:02,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:02,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:02,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:02,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:02,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:02,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:02,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:02,475 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:02,550 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-08-05 11:12:02,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:02,551 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:02,552 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:02,552 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:02,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:02,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 111. [2019-08-05 11:12:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:02,555 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:02,555 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:02,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:02,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:02,556 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:02,556 INFO L418 AbstractCegarLoop]: === Iteration 683 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:02,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1617670810, now seen corresponding path program 665 times [2019-08-05 11:12:02,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:02,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:02,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:02,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:02,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:02,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:02,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:02,697 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:02,766 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-08-05 11:12:02,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:02,766 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:02,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:02,767 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:02,767 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:02,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 119. [2019-08-05 11:12:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:02,770 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:02,770 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:02,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:02,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:02,771 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:02,771 INFO L418 AbstractCegarLoop]: === Iteration 684 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:02,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:02,772 INFO L82 PathProgramCache]: Analyzing trace with hash -741311528, now seen corresponding path program 666 times [2019-08-05 11:12:02,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:02,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:02,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:02,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:02,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:02,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:02,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:02,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:02,913 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:02,984 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-08-05 11:12:02,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:02,984 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:02,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:02,985 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:02,985 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:02,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:02,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 115. [2019-08-05 11:12:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:02,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:02,989 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:02,989 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:02,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:02,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:02,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:02,989 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:02,990 INFO L418 AbstractCegarLoop]: === Iteration 685 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:02,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:02,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1357231192, now seen corresponding path program 667 times [2019-08-05 11:12:02,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:02,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:02,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:03,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:03,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:03,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:03,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:03,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:03,115 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:03,180 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:03,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:03,180 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:03,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:03,181 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:03,181 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:03,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:03,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 119. [2019-08-05 11:12:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:03,185 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:03,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:03,185 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:03,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:03,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:03,186 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:03,186 INFO L418 AbstractCegarLoop]: === Iteration 686 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:03,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:03,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1001751146, now seen corresponding path program 668 times [2019-08-05 11:12:03,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:03,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:03,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:03,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:03,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:03,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:03,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:03,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:03,337 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:03,401 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:03,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:03,402 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:03,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:03,403 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:03,403 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:03,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:03,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:03,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 103. [2019-08-05 11:12:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:12:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:12:03,406 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:12:03,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:03,407 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:12:03,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:12:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:03,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:03,407 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:03,407 INFO L418 AbstractCegarLoop]: === Iteration 687 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:03,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:03,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1949232932, now seen corresponding path program 669 times [2019-08-05 11:12:03,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:03,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:03,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:03,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:03,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:03,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:03,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:03,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:03,586 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:12:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:03,646 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:12:03,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:03,647 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:03,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:03,647 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:12:03,648 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:12:03,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:12:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 119. [2019-08-05 11:12:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:03,651 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:03,651 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:03,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:03,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:03,652 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:03,652 INFO L418 AbstractCegarLoop]: === Iteration 688 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:03,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:03,652 INFO L82 PathProgramCache]: Analyzing trace with hash -13247974, now seen corresponding path program 670 times [2019-08-05 11:12:03,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:03,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:03,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:03,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:03,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:03,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:03,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:03,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:03,776 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:03,843 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:12:03,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:03,843 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:03,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:03,844 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:12:03,844 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:12:03,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:03,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:12:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 115. [2019-08-05 11:12:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:03,849 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:03,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:03,849 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:03,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:03,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:03,849 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:03,850 INFO L418 AbstractCegarLoop]: === Iteration 689 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2085294746, now seen corresponding path program 671 times [2019-08-05 11:12:03,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:03,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:03,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:03,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:03,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:03,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:03,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:03,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:03,979 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:04,050 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2019-08-05 11:12:04,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:04,050 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:04,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:04,051 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:04,051 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:04,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:04,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 119. [2019-08-05 11:12:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:04,054 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:04,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:04,054 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:04,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:04,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:04,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:04,055 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:04,055 INFO L418 AbstractCegarLoop]: === Iteration 690 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:04,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash -273687592, now seen corresponding path program 672 times [2019-08-05 11:12:04,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:04,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:04,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:04,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:04,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:04,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:04,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:04,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:04,183 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:04,284 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2019-08-05 11:12:04,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:04,284 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:04,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:04,285 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:04,285 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:04,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:04,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 111. [2019-08-05 11:12:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:04,288 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:04,289 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:04,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:04,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:04,289 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:04,289 INFO L418 AbstractCegarLoop]: === Iteration 691 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:04,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:04,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1768500250, now seen corresponding path program 673 times [2019-08-05 11:12:04,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:04,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:04,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:04,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:04,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:04,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:04,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:04,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:04,661 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:04,725 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:04,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:04,726 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:04,726 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:04,727 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:04,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 119. [2019-08-05 11:12:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:04,730 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:04,731 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:04,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:04,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:04,731 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:04,731 INFO L418 AbstractCegarLoop]: === Iteration 692 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:04,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:04,732 INFO L82 PathProgramCache]: Analyzing trace with hash -590482088, now seen corresponding path program 674 times [2019-08-05 11:12:04,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:04,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:04,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:04,856 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:04,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:04,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:04,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:04,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:04,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:04,857 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:04,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:04,919 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:04,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:04,919 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:04,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:04,920 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:04,920 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:04,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 115. [2019-08-05 11:12:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:04,924 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:04,924 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:04,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:04,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:04,924 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:04,924 INFO L418 AbstractCegarLoop]: === Iteration 693 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1508060632, now seen corresponding path program 675 times [2019-08-05 11:12:04,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:04,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:04,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:05,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:05,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:05,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:05,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:05,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:05,053 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:05,121 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:05,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:05,122 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:05,122 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:05,123 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:05,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:05,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 119. [2019-08-05 11:12:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:05,126 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:05,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:05,126 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:05,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:05,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:05,127 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:05,127 INFO L418 AbstractCegarLoop]: === Iteration 694 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:05,127 INFO L82 PathProgramCache]: Analyzing trace with hash -850921706, now seen corresponding path program 676 times [2019-08-05 11:12:05,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:05,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:05,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:05,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:05,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:05,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:05,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:05,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:05,263 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:05,331 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:05,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:05,331 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:05,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:05,332 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:05,332 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:05,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:05,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 107. [2019-08-05 11:12:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:12:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:12:05,335 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:12:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:05,335 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:12:05,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:12:05,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:05,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:05,336 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:05,336 INFO L418 AbstractCegarLoop]: === Iteration 695 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:05,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:05,336 INFO L82 PathProgramCache]: Analyzing trace with hash -956234598, now seen corresponding path program 677 times [2019-08-05 11:12:05,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:05,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:05,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:05,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:05,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:05,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:05,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:05,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:05,465 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:12:05,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:05,534 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:05,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:05,535 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:05,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:05,536 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:05,536 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:05,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:05,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:05,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 119. [2019-08-05 11:12:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:05,539 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:05,540 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:05,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:05,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:05,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:05,540 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:05,540 INFO L418 AbstractCegarLoop]: === Iteration 696 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:05,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:05,540 INFO L82 PathProgramCache]: Analyzing trace with hash 979750360, now seen corresponding path program 678 times [2019-08-05 11:12:05,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:05,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:05,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:05,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:05,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:05,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:05,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:05,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:05,692 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:05,758 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:05,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:05,759 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:05,760 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:05,760 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:05,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:05,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 115. [2019-08-05 11:12:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:05,764 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:05,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:05,764 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:05,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:05,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:05,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:05,764 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:05,764 INFO L418 AbstractCegarLoop]: === Iteration 697 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:05,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:05,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1216674216, now seen corresponding path program 679 times [2019-08-05 11:12:05,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:05,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:05,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:05,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:05,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:05,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:05,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:05,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:05,900 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:05,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:05,971 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:05,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:05,972 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:05,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:05,972 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:05,973 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:05,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:05,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:05,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 119. [2019-08-05 11:12:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:05,976 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:05,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:05,976 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:05,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:05,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:05,976 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:05,977 INFO L418 AbstractCegarLoop]: === Iteration 698 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:05,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:05,977 INFO L82 PathProgramCache]: Analyzing trace with hash 719310742, now seen corresponding path program 680 times [2019-08-05 11:12:05,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:05,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:05,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:06,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:06,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:06,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:06,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:06,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:06,105 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:06,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:06,167 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:06,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:06,168 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:06,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:06,169 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:06,169 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:06,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:06,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 111. [2019-08-05 11:12:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:06,172 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:06,172 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:06,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:06,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:06,173 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:06,173 INFO L418 AbstractCegarLoop]: === Iteration 699 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:06,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:06,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1533468712, now seen corresponding path program 681 times [2019-08-05 11:12:06,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:06,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:06,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:06,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:06,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:06,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:06,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:06,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:06,322 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:06,394 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2019-08-05 11:12:06,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:06,394 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:06,395 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:06,395 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:06,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:06,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:06,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 119. [2019-08-05 11:12:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:06,398 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:06,399 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:06,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:06,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:06,399 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:06,399 INFO L418 AbstractCegarLoop]: === Iteration 700 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:06,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:06,400 INFO L82 PathProgramCache]: Analyzing trace with hash 402516246, now seen corresponding path program 682 times [2019-08-05 11:12:06,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:06,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:06,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:06,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:06,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:06,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:06,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:06,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:06,523 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:06,592 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2019-08-05 11:12:06,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:06,592 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:06,593 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:06,593 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:06,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:06,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:06,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 115. [2019-08-05 11:12:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:06,596 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:06,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:06,596 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:06,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:06,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:06,597 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:06,597 INFO L418 AbstractCegarLoop]: === Iteration 701 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:06,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:06,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1793908330, now seen corresponding path program 683 times [2019-08-05 11:12:06,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:06,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:06,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:06,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:06,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:06,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:06,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:06,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:06,724 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:06,789 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:12:06,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:06,789 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:06,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:06,790 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:12:06,790 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:12:06,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:12:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 119. [2019-08-05 11:12:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:06,794 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:06,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:06,794 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:06,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:06,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:06,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:06,795 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:06,795 INFO L418 AbstractCegarLoop]: === Iteration 702 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:06,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:06,795 INFO L82 PathProgramCache]: Analyzing trace with hash 142076628, now seen corresponding path program 684 times [2019-08-05 11:12:06,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:06,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:06,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:06,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:06,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:06,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:06,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:06,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:06,920 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:06,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:06,981 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:12:06,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:06,982 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:06,983 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:12:06,983 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:12:06,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:06,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:12:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 99. [2019-08-05 11:12:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:12:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:12:06,986 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:12:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:06,986 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:12:06,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:12:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:06,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:06,987 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:06,987 INFO L418 AbstractCegarLoop]: === Iteration 703 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:06,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1239185060, now seen corresponding path program 685 times [2019-08-05 11:12:06,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:06,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:06,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:07,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:07,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:07,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:07,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:07,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:07,130 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:12:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:07,196 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:12:07,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:07,196 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:07,197 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:12:07,197 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:12:07,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:07,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:12:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 119. [2019-08-05 11:12:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:07,200 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:07,200 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:07,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:07,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:07,201 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:07,201 INFO L418 AbstractCegarLoop]: === Iteration 704 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:07,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:07,201 INFO L82 PathProgramCache]: Analyzing trace with hash 696799898, now seen corresponding path program 686 times [2019-08-05 11:12:07,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:07,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:07,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:07,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:07,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:07,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:07,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:07,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:07,331 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:07,400 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:12:07,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:07,401 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:07,401 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:12:07,402 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:12:07,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:12:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 115. [2019-08-05 11:12:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:07,405 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:07,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:07,405 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:07,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:07,405 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:07,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:07,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:07,406 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:07,406 INFO L418 AbstractCegarLoop]: === Iteration 705 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:07,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:07,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1499624678, now seen corresponding path program 687 times [2019-08-05 11:12:07,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:07,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:07,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:07,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:07,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:07,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:07,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:07,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:07,535 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:07,599 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2019-08-05 11:12:07,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:07,599 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:07,600 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:07,600 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:07,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 119. [2019-08-05 11:12:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:07,603 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:07,604 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:07,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:07,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:07,604 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:07,604 INFO L418 AbstractCegarLoop]: === Iteration 706 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:07,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:07,605 INFO L82 PathProgramCache]: Analyzing trace with hash 436360280, now seen corresponding path program 688 times [2019-08-05 11:12:07,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:07,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:07,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:07,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:07,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:07,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:07,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:07,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:07,744 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:07,809 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2019-08-05 11:12:07,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:07,809 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:07,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:07,810 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:07,810 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:07,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:07,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 111. [2019-08-05 11:12:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:07,813 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:07,813 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:07,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:07,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:07,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:07,814 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:07,814 INFO L418 AbstractCegarLoop]: === Iteration 707 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:07,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:07,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1816419174, now seen corresponding path program 689 times [2019-08-05 11:12:07,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:07,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:07,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:07,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:07,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:07,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:07,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:07,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:07,951 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:08,022 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:08,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:08,023 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:08,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:08,023 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:08,024 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:08,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:08,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:08,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 119. [2019-08-05 11:12:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:08,027 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:08,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:08,028 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:08,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:08,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:08,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:08,028 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:08,028 INFO L418 AbstractCegarLoop]: === Iteration 708 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:08,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:08,029 INFO L82 PathProgramCache]: Analyzing trace with hash 119565784, now seen corresponding path program 690 times [2019-08-05 11:12:08,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:08,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:08,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:08,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:08,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:08,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:08,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:08,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:08,155 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:08,220 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:08,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:08,220 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:08,221 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:08,221 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:08,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:08,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:08,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 115. [2019-08-05 11:12:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:08,225 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:08,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:08,225 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:08,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:08,225 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:08,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:08,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:08,226 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:08,226 INFO L418 AbstractCegarLoop]: === Iteration 709 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:08,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:08,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2076858792, now seen corresponding path program 691 times [2019-08-05 11:12:08,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:08,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:08,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:08,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:08,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:08,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:08,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:08,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:08,376 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:08,444 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:08,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:08,444 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:08,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:08,445 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:08,445 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:08,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:08,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 119. [2019-08-05 11:12:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:08,449 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:08,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:08,449 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:08,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:08,449 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:08,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:08,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:08,450 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:08,450 INFO L418 AbstractCegarLoop]: === Iteration 710 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:08,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:08,450 INFO L82 PathProgramCache]: Analyzing trace with hash -140873834, now seen corresponding path program 692 times [2019-08-05 11:12:08,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:08,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:08,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:08,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:08,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:08,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:08,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:08,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:08,596 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:08,662 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:08,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:08,662 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:08,663 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:08,663 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:08,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 107. [2019-08-05 11:12:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:12:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:12:08,666 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:12:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:08,667 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:12:08,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:12:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:08,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:08,667 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:08,667 INFO L418 AbstractCegarLoop]: === Iteration 711 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:08,668 INFO L82 PathProgramCache]: Analyzing trace with hash -246186726, now seen corresponding path program 693 times [2019-08-05 11:12:08,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:08,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:08,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:08,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:08,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:08,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:08,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:08,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:08,796 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:12:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:08,857 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:08,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:08,858 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:08,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:08,859 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:08,859 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:08,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:08,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 119. [2019-08-05 11:12:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:08,862 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:08,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:08,862 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:08,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:08,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:08,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:08,863 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:08,863 INFO L418 AbstractCegarLoop]: === Iteration 712 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:08,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:08,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1689798232, now seen corresponding path program 694 times [2019-08-05 11:12:08,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:08,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:08,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:09,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:09,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:09,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:09,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:09,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:09,004 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:09,072 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:09,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:09,073 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:09,074 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:09,074 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:09,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:09,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 115. [2019-08-05 11:12:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:09,077 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:09,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:09,077 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:09,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:09,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:09,078 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:09,078 INFO L418 AbstractCegarLoop]: === Iteration 713 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:09,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:09,078 INFO L82 PathProgramCache]: Analyzing trace with hash -506626344, now seen corresponding path program 695 times [2019-08-05 11:12:09,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:09,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:09,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:09,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:09,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:09,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:09,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:09,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:09,207 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:09,277 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:09,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:09,277 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:09,278 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:09,278 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:09,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 119. [2019-08-05 11:12:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:09,283 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:09,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:09,283 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:09,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:09,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:09,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:09,284 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:09,284 INFO L418 AbstractCegarLoop]: === Iteration 714 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:09,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:09,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1429358614, now seen corresponding path program 696 times [2019-08-05 11:12:09,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:09,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:09,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:09,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:09,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:09,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:09,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:09,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:09,736 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:09,808 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:09,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:09,808 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:09,809 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:09,809 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:09,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 111. [2019-08-05 11:12:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:09,812 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:09,812 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:09,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:09,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:09,813 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:09,813 INFO L418 AbstractCegarLoop]: === Iteration 715 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:09,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash -823420840, now seen corresponding path program 697 times [2019-08-05 11:12:09,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:09,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:09,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:09,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:09,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:09,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:09,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:09,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:09,936 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:09,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:09,998 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2019-08-05 11:12:09,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:09,998 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:09,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:09,999 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:09,999 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:09,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 119. [2019-08-05 11:12:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:10,002 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:10,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:10,003 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:10,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:10,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:10,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:10,003 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:10,003 INFO L418 AbstractCegarLoop]: === Iteration 716 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:10,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:10,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1112564118, now seen corresponding path program 698 times [2019-08-05 11:12:10,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:10,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:10,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:10,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:10,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:10,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:10,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:10,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:10,155 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:10,227 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2019-08-05 11:12:10,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:10,227 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:10,228 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:10,228 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:10,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 115. [2019-08-05 11:12:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:10,232 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:10,232 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:10,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:10,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:10,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:10,233 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:10,233 INFO L418 AbstractCegarLoop]: === Iteration 717 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:10,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:10,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1083860458, now seen corresponding path program 699 times [2019-08-05 11:12:10,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:10,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:10,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:10,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:10,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:10,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:10,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:10,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:10,352 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:10,419 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:12:10,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:10,419 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:10,420 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:12:10,420 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:12:10,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:12:10,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 119. [2019-08-05 11:12:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:10,423 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:10,423 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:10,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:10,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:10,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:10,424 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:10,424 INFO L418 AbstractCegarLoop]: === Iteration 718 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:10,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:10,424 INFO L82 PathProgramCache]: Analyzing trace with hash 852124500, now seen corresponding path program 700 times [2019-08-05 11:12:10,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:10,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:10,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:10,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:10,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:10,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:10,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:10,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:10,549 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:10,610 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:12:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:10,611 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:10,611 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:12:10,611 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:12:10,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:12:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 103. [2019-08-05 11:12:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:12:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:12:10,616 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:12:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:10,616 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:12:10,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:12:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:10,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:10,616 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:10,616 INFO L418 AbstractCegarLoop]: === Iteration 719 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:10,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:10,617 INFO L82 PathProgramCache]: Analyzing trace with hash -95357286, now seen corresponding path program 701 times [2019-08-05 11:12:10,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:10,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:10,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:10,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:10,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:10,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:10,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:10,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:10,741 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:12:10,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:10,813 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:10,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:10,813 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:10,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:10,814 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:10,814 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:10,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:10,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 119. [2019-08-05 11:12:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:10,817 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:10,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:10,818 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:10,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:10,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:10,818 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:10,818 INFO L418 AbstractCegarLoop]: === Iteration 720 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:10,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:10,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1840627672, now seen corresponding path program 702 times [2019-08-05 11:12:10,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:10,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:10,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:10,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:10,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:10,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:10,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:10,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:10,979 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:11,055 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:11,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:11,056 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:11,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:11,057 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:11,057 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:11,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 115. [2019-08-05 11:12:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:11,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:11,060 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:11,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:11,060 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:11,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:11,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:11,061 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:11,061 INFO L418 AbstractCegarLoop]: === Iteration 721 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:11,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:11,061 INFO L82 PathProgramCache]: Analyzing trace with hash -355796904, now seen corresponding path program 703 times [2019-08-05 11:12:11,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:11,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:11,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:11,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:11,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:11,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:11,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:11,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:11,194 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:11,261 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-08-05 11:12:11,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:11,261 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:11,262 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:11,262 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:11,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 119. [2019-08-05 11:12:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:11,266 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:11,266 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:11,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:11,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:11,266 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:11,267 INFO L418 AbstractCegarLoop]: === Iteration 722 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:11,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1580188054, now seen corresponding path program 704 times [2019-08-05 11:12:11,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:11,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:11,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:11,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:11,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:11,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:11,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:11,404 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:11,465 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-08-05 11:12:11,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:11,466 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:11,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:11,467 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:11,467 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:11,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 111. [2019-08-05 11:12:11,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:11,470 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:11,470 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:11,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:11,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:11,471 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:11,471 INFO L418 AbstractCegarLoop]: === Iteration 723 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:11,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:11,471 INFO L82 PathProgramCache]: Analyzing trace with hash -672591400, now seen corresponding path program 705 times [2019-08-05 11:12:11,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:11,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:11,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:11,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:11,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:11,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:11,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:11,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:11,603 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:11,669 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-08-05 11:12:11,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:11,669 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:11,670 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:11,670 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:11,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 119. [2019-08-05 11:12:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:11,673 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:11,674 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:11,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:11,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:11,674 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:11,674 INFO L418 AbstractCegarLoop]: === Iteration 724 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:11,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:11,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1263393558, now seen corresponding path program 706 times [2019-08-05 11:12:11,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:11,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:11,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:11,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:11,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:11,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:11,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:11,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:11,805 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:11,873 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-08-05 11:12:11,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:11,873 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:11,874 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:11,874 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:11,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 115. [2019-08-05 11:12:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:11,878 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:11,878 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:11,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:11,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:11,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:11,878 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:11,879 INFO L418 AbstractCegarLoop]: === Iteration 725 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:11,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:11,879 INFO L82 PathProgramCache]: Analyzing trace with hash -933031018, now seen corresponding path program 707 times [2019-08-05 11:12:11,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:11,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:11,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:12,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:12,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:12,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:12,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:12,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:12,010 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:12,081 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:12,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:12,082 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:12,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:12,083 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:12,083 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:12,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:12,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 119. [2019-08-05 11:12:12,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:12,086 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:12,086 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:12,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:12,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:12,087 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:12,087 INFO L418 AbstractCegarLoop]: === Iteration 726 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:12,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1002953940, now seen corresponding path program 708 times [2019-08-05 11:12:12,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:12,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:12,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:12,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:12,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:12,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:12,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:12,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:12,256 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:12,334 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:12,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:12,334 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:12,335 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:12,335 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:12,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:12,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 107. [2019-08-05 11:12:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:12:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:12:12,338 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:12:12,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:12,338 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:12:12,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:12:12,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:12,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:12,338 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:12,338 INFO L418 AbstractCegarLoop]: === Iteration 727 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:12,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:12,339 INFO L82 PathProgramCache]: Analyzing trace with hash 897641048, now seen corresponding path program 709 times [2019-08-05 11:12:12,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:12,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:12,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:12,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:12,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:12,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:12,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:12,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:12,497 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:12:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:12,563 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:12,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:12,564 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:12,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:12,565 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:12,565 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:12,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 119. [2019-08-05 11:12:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:12,568 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:12,568 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:12,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:12,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:12,568 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:12,569 INFO L418 AbstractCegarLoop]: === Iteration 728 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:12,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:12,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1461341290, now seen corresponding path program 710 times [2019-08-05 11:12:12,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:12,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:12,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:12,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:12,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:12,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:12,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:12,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:12,703 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:12,772 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:12,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:12,772 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:12,773 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:12,773 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:12,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 115. [2019-08-05 11:12:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:12,778 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:12,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:12,778 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:12,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:12,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:12,778 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:12,778 INFO L418 AbstractCegarLoop]: === Iteration 729 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:12,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:12,779 INFO L82 PathProgramCache]: Analyzing trace with hash 637201430, now seen corresponding path program 711 times [2019-08-05 11:12:12,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:12,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:12,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:12,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:12,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:12,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:12,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:12,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:12,895 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:12,963 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:12,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:12,964 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:12,964 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:12,965 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:12,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:12,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 119. [2019-08-05 11:12:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:12,968 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:12,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:12,968 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:12,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:12,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:12,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:12,969 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:12,969 INFO L418 AbstractCegarLoop]: === Iteration 730 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:12,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:12,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1721780908, now seen corresponding path program 712 times [2019-08-05 11:12:12,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:12,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:12,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:13,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:13,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:13,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:13,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:13,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:13,099 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:13,169 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:13,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:13,170 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:13,171 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:13,171 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:13,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:13,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 111. [2019-08-05 11:12:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:13,175 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:13,175 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:13,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:13,175 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:13,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:13,175 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:13,175 INFO L418 AbstractCegarLoop]: === Iteration 731 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:13,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:13,176 INFO L82 PathProgramCache]: Analyzing trace with hash 320406934, now seen corresponding path program 713 times [2019-08-05 11:12:13,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:13,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:13,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:13,349 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:13,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:13,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:13,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:13,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:13,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:13,350 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:13,434 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:13,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:13,434 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:13,435 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:13,435 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:13,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 119. [2019-08-05 11:12:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:13,439 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:13,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:13,439 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:13,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:13,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:13,440 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:13,440 INFO L418 AbstractCegarLoop]: === Iteration 732 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:13,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:13,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2038575404, now seen corresponding path program 714 times [2019-08-05 11:12:13,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:13,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:13,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:13,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:13,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:13,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:13,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:13,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:13,568 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:13,634 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:13,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:13,634 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:13,635 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:13,635 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:13,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:13,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 115. [2019-08-05 11:12:13,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:13,639 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:13,639 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:13,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:13,639 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:13,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:13,640 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:13,640 INFO L418 AbstractCegarLoop]: === Iteration 733 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:13,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:13,640 INFO L82 PathProgramCache]: Analyzing trace with hash 59967316, now seen corresponding path program 715 times [2019-08-05 11:12:13,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:13,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:13,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:13,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:13,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:13,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:13,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:13,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:13,769 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:13,841 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2019-08-05 11:12:13,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:13,841 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:13,842 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:12:13,842 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:12:13,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:12:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 119. [2019-08-05 11:12:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:13,845 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:13,845 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:13,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:13,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:13,846 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:13,846 INFO L418 AbstractCegarLoop]: === Iteration 734 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:13,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:13,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1995952274, now seen corresponding path program 716 times [2019-08-05 11:12:13,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:13,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:13,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:13,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:13,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:13,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:13,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:13,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:13,974 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:14,032 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2019-08-05 11:12:14,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:14,032 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:14,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:14,033 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:12:14,033 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:12:14,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:12:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 95. [2019-08-05 11:12:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:12:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-08-05 11:12:14,036 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 68 [2019-08-05 11:12:14,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:14,037 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-08-05 11:12:14,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-08-05 11:12:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:14,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:14,037 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:14,037 INFO L418 AbstractCegarLoop]: === Iteration 735 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash -607624484, now seen corresponding path program 717 times [2019-08-05 11:12:14,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:14,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:14,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:14,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:14,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:14,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:14,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:14,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:14,173 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 21 states. [2019-08-05 11:12:14,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:14,232 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2019-08-05 11:12:14,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:14,232 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:14,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:14,233 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:12:14,233 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:12:14,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:14,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:12:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 115. [2019-08-05 11:12:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:14,236 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:14,236 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:14,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:14,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:14,237 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:14,237 INFO L418 AbstractCegarLoop]: === Iteration 736 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:14,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:14,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1328360474, now seen corresponding path program 718 times [2019-08-05 11:12:14,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:14,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:14,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:14,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:14,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:14,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:14,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:14,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:14,368 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:14,470 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2019-08-05 11:12:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:14,470 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:14,470 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:14,470 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:14,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 111. [2019-08-05 11:12:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:14,474 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:14,474 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:14,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:14,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:14,475 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:14,475 INFO L418 AbstractCegarLoop]: === Iteration 737 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:14,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:14,475 INFO L82 PathProgramCache]: Analyzing trace with hash -868064102, now seen corresponding path program 719 times [2019-08-05 11:12:14,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:14,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:14,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:14,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:14,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:14,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:14,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:14,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:14,942 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:15,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:15,010 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:15,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:15,011 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:15,011 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:15,011 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:15,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:15,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-08-05 11:12:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:15,015 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:15,015 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:15,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:15,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:15,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:15,016 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:15,016 INFO L418 AbstractCegarLoop]: === Iteration 738 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:15,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1067920856, now seen corresponding path program 720 times [2019-08-05 11:12:15,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:15,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:15,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:15,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:15,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:15,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:15,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:15,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:15,145 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:15,272 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:15,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:15,272 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:15,273 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:15,273 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:15,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:15,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 107. [2019-08-05 11:12:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:12:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:12:15,276 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:12:15,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:15,277 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:12:15,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:12:15,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:15,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:15,277 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:15,277 INFO L418 AbstractCegarLoop]: === Iteration 739 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:15,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:15,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1184858598, now seen corresponding path program 721 times [2019-08-05 11:12:15,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:15,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:15,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:15,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:15,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:15,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:15,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:15,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:15,404 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:12:15,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:15,465 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:15,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:15,466 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:15,467 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:15,467 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:15,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-08-05 11:12:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:15,470 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:15,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:15,471 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:15,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:15,471 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:15,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:15,471 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:15,471 INFO L418 AbstractCegarLoop]: === Iteration 740 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:15,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:15,471 INFO L82 PathProgramCache]: Analyzing trace with hash 751126360, now seen corresponding path program 722 times [2019-08-05 11:12:15,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:15,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:15,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:15,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:15,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:15,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:15,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:15,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:15,599 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:15,663 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:15,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:15,663 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:15,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:15,664 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:15,664 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:15,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:15,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 111. [2019-08-05 11:12:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:15,667 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:15,668 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:15,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:15,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:15,668 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:15,668 INFO L418 AbstractCegarLoop]: === Iteration 741 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:15,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:15,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1445298216, now seen corresponding path program 723 times [2019-08-05 11:12:15,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:15,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:15,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:15,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:15,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:15,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:15,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:15,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:15,812 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:15,876 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:15,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:15,877 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:15,877 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:15,878 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:15,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:15,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-08-05 11:12:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:15,881 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:15,881 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:15,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:15,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:15,882 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:15,882 INFO L418 AbstractCegarLoop]: === Iteration 742 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:15,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:15,882 INFO L82 PathProgramCache]: Analyzing trace with hash 490686742, now seen corresponding path program 724 times [2019-08-05 11:12:15,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:15,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:15,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:16,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:16,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:16,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:16,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:16,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:16,004 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:16,067 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:16,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:16,067 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:16,068 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:16,068 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:16,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 103. [2019-08-05 11:12:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:12:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:12:16,072 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:12:16,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:16,072 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:12:16,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:16,072 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:12:16,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:16,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:16,073 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:16,073 INFO L418 AbstractCegarLoop]: === Iteration 743 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:16,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:16,073 INFO L82 PathProgramCache]: Analyzing trace with hash 385373850, now seen corresponding path program 725 times [2019-08-05 11:12:16,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:16,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:16,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:16,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:16,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:16,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:16,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:16,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:16,201 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:12:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:16,272 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:16,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:16,272 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:16,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:16,273 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:16,273 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:16,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 115. [2019-08-05 11:12:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:16,276 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:16,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:16,276 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:16,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:16,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:16,277 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:16,277 INFO L418 AbstractCegarLoop]: === Iteration 744 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:16,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:16,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1973608488, now seen corresponding path program 726 times [2019-08-05 11:12:16,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:16,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:16,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:16,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:16,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:16,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:16,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:16,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:16,407 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:16,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:16,471 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:16,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:16,472 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:16,473 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:16,473 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:16,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:16,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 111. [2019-08-05 11:12:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:16,476 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:16,476 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:16,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:16,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:16,477 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:16,477 INFO L418 AbstractCegarLoop]: === Iteration 745 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:16,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:16,477 INFO L82 PathProgramCache]: Analyzing trace with hash 124934232, now seen corresponding path program 727 times [2019-08-05 11:12:16,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:16,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:16,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:16,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:16,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:16,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:16,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:16,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:16,622 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:16,692 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-08-05 11:12:16,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:16,693 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:16,694 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:16,694 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:16,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 115. [2019-08-05 11:12:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:16,697 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:16,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:16,697 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:16,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:16,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:16,698 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:16,698 INFO L418 AbstractCegarLoop]: === Iteration 746 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:16,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:16,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2060919190, now seen corresponding path program 728 times [2019-08-05 11:12:16,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:16,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:16,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:16,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:16,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:16,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:16,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:16,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:16,852 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:16,925 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-08-05 11:12:16,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:16,926 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:16,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:16,926 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:16,927 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:16,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 107. [2019-08-05 11:12:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:12:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:12:16,930 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:12:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:16,930 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:12:16,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:12:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:16,930 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:16,930 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:16,931 INFO L418 AbstractCegarLoop]: === Iteration 747 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:16,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:16,931 INFO L82 PathProgramCache]: Analyzing trace with hash -191860264, now seen corresponding path program 729 times [2019-08-05 11:12:16,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:16,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:16,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:17,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:17,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:17,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:17,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:17,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:17,060 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:12:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:17,123 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-08-05 11:12:17,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:17,123 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:17,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:17,124 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:17,124 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:17,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 115. [2019-08-05 11:12:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:17,127 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:17,128 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:17,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:17,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:17,128 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:17,128 INFO L418 AbstractCegarLoop]: === Iteration 748 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:17,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:17,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1744124694, now seen corresponding path program 730 times [2019-08-05 11:12:17,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:17,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:17,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:17,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:17,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:17,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:17,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:17,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:17,308 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:17,376 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-08-05 11:12:17,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:17,377 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:17,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:17,378 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:17,378 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:17,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 111. [2019-08-05 11:12:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:17,381 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:17,381 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:17,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:17,381 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:17,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:17,382 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:17,382 INFO L418 AbstractCegarLoop]: === Iteration 749 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:17,382 INFO L82 PathProgramCache]: Analyzing trace with hash -452299882, now seen corresponding path program 731 times [2019-08-05 11:12:17,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:17,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:17,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:17,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:17,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:17,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:17,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:17,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:17,514 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:17,582 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:17,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:17,582 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:17,583 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:17,583 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:17,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 115. [2019-08-05 11:12:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:17,587 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:17,587 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:17,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:17,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:17,588 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:17,588 INFO L418 AbstractCegarLoop]: === Iteration 750 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:17,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:17,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1483685076, now seen corresponding path program 732 times [2019-08-05 11:12:17,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:17,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:17,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:17,717 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:17,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:17,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:17,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:17,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:17,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:17,718 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:17,780 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:17,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:17,781 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:17,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:17,781 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:17,781 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:17,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:17,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 99. [2019-08-05 11:12:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:12:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:12:17,785 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:12:17,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:17,785 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:12:17,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:12:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:17,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:17,786 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:17,786 INFO L418 AbstractCegarLoop]: === Iteration 751 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:17,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:17,786 INFO L82 PathProgramCache]: Analyzing trace with hash 536203290, now seen corresponding path program 733 times [2019-08-05 11:12:17,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:17,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:17,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:17,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:17,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:17,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:17,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:17,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:17,910 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:12:17,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:17,978 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:17,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:17,978 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:17,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:17,979 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:17,979 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:17,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:17,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:17,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 115. [2019-08-05 11:12:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:17,983 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:17,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:17,983 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:17,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:17,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:17,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:17,983 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:17,984 INFO L418 AbstractCegarLoop]: === Iteration 752 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:17,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:17,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1822779048, now seen corresponding path program 734 times [2019-08-05 11:12:17,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:17,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:17,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:18,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:18,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:18,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:18,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:18,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:18,117 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:18,180 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:18,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:18,181 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:18,181 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:18,182 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:18,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 111. [2019-08-05 11:12:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:18,185 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:18,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:18,186 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:18,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:18,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:18,186 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:18,186 INFO L418 AbstractCegarLoop]: === Iteration 753 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:18,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:18,187 INFO L82 PathProgramCache]: Analyzing trace with hash 275763672, now seen corresponding path program 735 times [2019-08-05 11:12:18,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:18,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:18,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:18,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:18,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:18,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:18,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:18,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:18,313 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:18,385 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2019-08-05 11:12:18,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:18,386 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:18,387 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:18,387 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:18,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:18,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 115. [2019-08-05 11:12:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:18,390 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:18,391 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:18,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:18,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:18,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:18,391 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:18,391 INFO L418 AbstractCegarLoop]: === Iteration 754 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:18,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:18,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1246251162, now seen corresponding path program 736 times [2019-08-05 11:12:18,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:18,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:18,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:18,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:18,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:18,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:18,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:18,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:18,525 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:18,588 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2019-08-05 11:12:18,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:18,588 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:18,589 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:18,589 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:18,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 95. [2019-08-05 11:12:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:12:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-08-05 11:12:18,593 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 68 [2019-08-05 11:12:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:18,593 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-08-05 11:12:18,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-08-05 11:12:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:18,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:18,594 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:18,594 INFO L418 AbstractCegarLoop]: === Iteration 755 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:18,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:18,594 INFO L82 PathProgramCache]: Analyzing trace with hash -2083218666, now seen corresponding path program 737 times [2019-08-05 11:12:18,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:18,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:18,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:18,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:18,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:18,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:18,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:18,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:18,731 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 21 states. [2019-08-05 11:12:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:18,809 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:12:18,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:18,809 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:18,810 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:12:18,810 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:12:18,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:12:18,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 87. [2019-08-05 11:12:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:12:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2019-08-05 11:12:18,814 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 68 [2019-08-05 11:12:18,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:18,814 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2019-08-05 11:12:18,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2019-08-05 11:12:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:18,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:18,815 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:18,815 INFO L418 AbstractCegarLoop]: === Iteration 756 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:18,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:18,815 INFO L82 PathProgramCache]: Analyzing trace with hash -41030824, now seen corresponding path program 738 times [2019-08-05 11:12:18,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:18,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:18,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:18,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:18,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:18,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:18,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:18,944 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand 21 states. [2019-08-05 11:12:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:19,008 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-08-05 11:12:19,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:19,009 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:19,009 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:12:19,009 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:12:19,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:12:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 95. [2019-08-05 11:12:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:12:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-08-05 11:12:19,013 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 68 [2019-08-05 11:12:19,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:19,013 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-08-05 11:12:19,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-08-05 11:12:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:19,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:19,014 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:19,014 INFO L418 AbstractCegarLoop]: === Iteration 757 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:19,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:19,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1667454446, now seen corresponding path program 739 times [2019-08-05 11:12:19,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:19,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:19,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:19,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:19,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:19,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:19,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:19,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:19,142 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 21 states. [2019-08-05 11:12:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:19,210 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2019-08-05 11:12:19,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:19,210 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:19,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:19,211 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:12:19,211 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:12:19,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:19,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:12:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 107. [2019-08-05 11:12:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:12:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:12:19,214 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:12:19,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:19,214 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:12:19,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:12:19,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:19,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:19,215 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:19,215 INFO L418 AbstractCegarLoop]: === Iteration 758 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:19,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:19,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1894954134, now seen corresponding path program 740 times [2019-08-05 11:12:19,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:19,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:19,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:19,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:19,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:19,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:19,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:19,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:19,518 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:12:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:19,623 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2019-08-05 11:12:19,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:19,623 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:19,624 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:19,624 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:12:19,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:12:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 103. [2019-08-05 11:12:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:12:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:12:19,628 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:12:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:19,629 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:12:19,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:12:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:19,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:19,629 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:19,629 INFO L418 AbstractCegarLoop]: === Iteration 759 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:19,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:19,629 INFO L82 PathProgramCache]: Analyzing trace with hash -301470442, now seen corresponding path program 741 times [2019-08-05 11:12:19,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:19,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:19,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:19,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:19,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:19,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:19,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:19,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:19,965 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:12:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:20,033 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:12:20,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:20,034 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:20,034 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:12:20,035 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:12:20,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:12:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 107. [2019-08-05 11:12:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:12:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:12:20,038 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:12:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:20,039 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:12:20,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:12:20,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:20,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:20,039 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:20,039 INFO L418 AbstractCegarLoop]: === Iteration 760 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:20,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1634514516, now seen corresponding path program 742 times [2019-08-05 11:12:20,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:20,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:20,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:20,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:20,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:20,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:20,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:20,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:20,166 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:12:20,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:20,233 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:12:20,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:20,233 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:20,234 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:12:20,234 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:12:20,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:12:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 95. [2019-08-05 11:12:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:12:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-08-05 11:12:20,238 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 68 [2019-08-05 11:12:20,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:20,238 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-08-05 11:12:20,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-08-05 11:12:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:20,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:20,239 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:20,239 INFO L418 AbstractCegarLoop]: === Iteration 761 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:20,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:20,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1529201624, now seen corresponding path program 743 times [2019-08-05 11:12:20,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:20,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:20,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:20,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:20,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:20,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:20,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:20,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:20,374 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 21 states. [2019-08-05 11:12:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:20,443 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:12:20,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:20,443 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:20,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:20,444 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:12:20,444 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:12:20,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:20,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:12:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 103. [2019-08-05 11:12:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:12:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:12:20,447 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:12:20,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:20,447 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:12:20,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:12:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:20,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:20,448 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:20,448 INFO L418 AbstractCegarLoop]: === Iteration 762 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:20,448 INFO L82 PathProgramCache]: Analyzing trace with hash -829780714, now seen corresponding path program 744 times [2019-08-05 11:12:20,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:20,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:20,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:20,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:20,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:20,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:20,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:20,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:20,570 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:12:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:20,640 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:12:20,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:20,640 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:20,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:20,641 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:12:20,641 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:12:20,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:12:20,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 99. [2019-08-05 11:12:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:12:20,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:12:20,645 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:12:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:20,645 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:12:20,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:12:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:20,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:20,645 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:20,645 INFO L418 AbstractCegarLoop]: === Iteration 763 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:20,646 INFO L82 PathProgramCache]: Analyzing trace with hash 691527892, now seen corresponding path program 745 times [2019-08-05 11:12:20,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:20,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:20,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:20,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:20,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:20,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:20,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:20,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:20,769 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:12:20,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:20,834 INFO L93 Difference]: Finished difference Result 187 states and 231 transitions. [2019-08-05 11:12:20,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:20,834 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:20,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:20,835 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:12:20,835 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:12:20,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:20,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:12:20,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 95. [2019-08-05 11:12:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:12:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-08-05 11:12:20,839 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 68 [2019-08-05 11:12:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:20,839 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-08-05 11:12:20,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-08-05 11:12:20,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:20,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:20,840 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:20,840 INFO L418 AbstractCegarLoop]: === Iteration 764 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:20,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:20,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1268762006, now seen corresponding path program 746 times [2019-08-05 11:12:20,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:20,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:20,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:21,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:21,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:21,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:21,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:21,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:21,247 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 21 states. [2019-08-05 11:12:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:21,320 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:12:21,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:21,321 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:21,322 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:12:21,322 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:12:21,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:12:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 99. [2019-08-05 11:12:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:12:21,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:12:21,324 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:12:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:21,325 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:12:21,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:21,325 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:12:21,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:21,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:21,325 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:21,325 INFO L418 AbstractCegarLoop]: === Iteration 765 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:21,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:21,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1090220332, now seen corresponding path program 747 times [2019-08-05 11:12:21,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:21,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:21,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:21,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:21,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:21,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:21,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:21,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:21,453 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:12:21,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:21,524 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-08-05 11:12:21,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:21,525 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:21,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:21,526 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:12:21,526 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:12:21,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:21,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:12:21,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 91. [2019-08-05 11:12:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:12:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2019-08-05 11:12:21,529 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 68 [2019-08-05 11:12:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:21,529 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2019-08-05 11:12:21,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2019-08-05 11:12:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:21,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:21,530 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:21,530 INFO L418 AbstractCegarLoop]: === Iteration 766 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:21,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:21,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1407014828, now seen corresponding path program 748 times [2019-08-05 11:12:21,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:21,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:21,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:21,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:21,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:21,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:21,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:21,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:21,659 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 21 states. [2019-08-05 11:12:21,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:21,727 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:12:21,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:21,727 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:21,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:21,728 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:12:21,728 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:12:21,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:12:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 95. [2019-08-05 11:12:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:12:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-08-05 11:12:21,732 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 68 [2019-08-05 11:12:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:21,732 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-08-05 11:12:21,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-08-05 11:12:21,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:21,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:21,732 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:21,732 INFO L418 AbstractCegarLoop]: === Iteration 767 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:21,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:21,733 INFO L82 PathProgramCache]: Analyzing trace with hash 951967510, now seen corresponding path program 749 times [2019-08-05 11:12:21,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:21,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:21,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:21,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:21,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:21,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:21,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:21,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:21,856 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 21 states. [2019-08-05 11:12:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:21,923 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 11:12:21,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:21,923 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:21,924 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:12:21,924 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:12:21,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:12:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 67. [2019-08-05 11:12:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:12:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2019-08-05 11:12:21,927 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 68 [2019-08-05 11:12:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:21,927 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2019-08-05 11:12:21,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2019-08-05 11:12:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:21,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:21,928 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:21,928 INFO L418 AbstractCegarLoop]: === Iteration 768 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:21,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:21,928 INFO L82 PathProgramCache]: Analyzing trace with hash 12049694, now seen corresponding path program 750 times [2019-08-05 11:12:21,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:21,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:21,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:12:22,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:22,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:22,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:22,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:22,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:22,084 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand 21 states. [2019-08-05 11:12:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:22,145 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2019-08-05 11:12:22,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:22,146 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:22,146 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:12:22,147 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:12:22,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:12:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2019-08-05 11:12:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:12:22,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:12:22,149 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:12:22,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:22,149 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:12:22,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:12:22,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:22,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:22,150 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:22,150 INFO L418 AbstractCegarLoop]: === Iteration 769 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:22,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:22,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1948034652, now seen corresponding path program 751 times [2019-08-05 11:12:22,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:22,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:22,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:22,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:22,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:22,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:22,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:22,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:22,375 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:12:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:22,456 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2019-08-05 11:12:22,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:22,457 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:22,458 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:12:22,458 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:12:22,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:12:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 95. [2019-08-05 11:12:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:12:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-08-05 11:12:22,461 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 68 [2019-08-05 11:12:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:22,461 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-08-05 11:12:22,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-08-05 11:12:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:22,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:22,462 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:22,462 INFO L418 AbstractCegarLoop]: === Iteration 770 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:22,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:22,462 INFO L82 PathProgramCache]: Analyzing trace with hash -248389924, now seen corresponding path program 752 times [2019-08-05 11:12:22,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:22,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:22,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:22,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:22,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:22,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:22,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:22,632 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 21 states. [2019-08-05 11:12:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:22,699 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2019-08-05 11:12:22,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:22,700 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:22,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:22,700 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:12:22,701 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:12:22,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:12:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 99. [2019-08-05 11:12:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:12:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:12:22,704 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:12:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:22,704 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:12:22,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:12:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:22,704 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:22,705 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:22,705 INFO L418 AbstractCegarLoop]: === Iteration 771 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:22,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:22,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1687595034, now seen corresponding path program 753 times [2019-08-05 11:12:22,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:22,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:22,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:22,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:22,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:22,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:22,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:22,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:22,828 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:12:22,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:22,896 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2019-08-05 11:12:22,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:22,896 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:22,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:22,897 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:12:22,897 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:12:22,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:12:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 91. [2019-08-05 11:12:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:12:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2019-08-05 11:12:22,901 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 68 [2019-08-05 11:12:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:22,901 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2019-08-05 11:12:22,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2019-08-05 11:12:22,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:22,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:22,901 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:22,901 INFO L418 AbstractCegarLoop]: === Iteration 772 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:22,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:22,902 INFO L82 PathProgramCache]: Analyzing trace with hash -565184420, now seen corresponding path program 754 times [2019-08-05 11:12:22,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:22,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:22,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:23,032 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:23,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:23,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:23,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:23,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:23,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:23,033 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 21 states. [2019-08-05 11:12:23,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:23,098 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2019-08-05 11:12:23,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:23,098 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:23,099 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:12:23,099 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:12:23,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:23,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:12:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 99. [2019-08-05 11:12:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:12:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:12:23,102 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:12:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:23,102 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:12:23,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:12:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:23,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:23,103 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:23,103 INFO L418 AbstractCegarLoop]: === Iteration 773 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:23,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:23,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1370800538, now seen corresponding path program 755 times [2019-08-05 11:12:23,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:23,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:23,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:23,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:23,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:23,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:23,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:23,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:23,256 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:12:23,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:23,321 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2019-08-05 11:12:23,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:23,322 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:23,322 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:12:23,323 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:12:23,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:12:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 95. [2019-08-05 11:12:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:12:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-08-05 11:12:23,326 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 68 [2019-08-05 11:12:23,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:23,326 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-08-05 11:12:23,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:23,326 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-08-05 11:12:23,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:23,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:23,327 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:23,327 INFO L418 AbstractCegarLoop]: === Iteration 774 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:23,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:23,327 INFO L82 PathProgramCache]: Analyzing trace with hash -825624038, now seen corresponding path program 756 times [2019-08-05 11:12:23,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:23,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:23,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:23,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:23,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:23,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:23,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:23,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:23,461 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 21 states. [2019-08-05 11:12:23,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:23,524 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2019-08-05 11:12:23,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:23,524 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:23,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:23,525 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:12:23,525 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:12:23,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:12:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 99. [2019-08-05 11:12:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:12:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:12:23,528 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:12:23,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:23,528 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:12:23,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:12:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:23,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:23,529 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:23,529 INFO L418 AbstractCegarLoop]: === Iteration 775 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:23,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:23,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1110360920, now seen corresponding path program 757 times [2019-08-05 11:12:23,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:23,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:23,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:23,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:23,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:23,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:23,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:23,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:23,655 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:12:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:23,724 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2019-08-05 11:12:23,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:23,724 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:23,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:23,725 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:12:23,725 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:12:23,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:12:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 87. [2019-08-05 11:12:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:12:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2019-08-05 11:12:23,728 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 68 [2019-08-05 11:12:23,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:23,729 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2019-08-05 11:12:23,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2019-08-05 11:12:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:23,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:23,729 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:12:23,729 INFO L418 AbstractCegarLoop]: === Iteration 776 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:23,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:23,730 INFO L82 PathProgramCache]: Analyzing trace with hash 94019854, now seen corresponding path program 9 times [2019-08-05 11:12:23,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:23,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:23,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-08-05 11:12:23,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:23,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:23,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:23,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:23,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:23,867 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand 21 states. [2019-08-05 11:12:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:23,920 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2019-08-05 11:12:23,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:23,921 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:23,921 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:12:23,921 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:12:23,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:12:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2019-08-05 11:12:23,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:23,924 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:23,924 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:23,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:23,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:23,925 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:23,925 INFO L418 AbstractCegarLoop]: === Iteration 777 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:23,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:23,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1005048028, now seen corresponding path program 758 times [2019-08-05 11:12:23,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:23,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:23,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:24,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:24,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:24,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:24,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:24,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:24,057 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:24,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:24,116 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2019-08-05 11:12:24,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:24,117 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:24,118 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:12:24,118 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:12:24,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:24,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:12:24,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 127. [2019-08-05 11:12:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:24,121 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:24,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:24,121 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:24,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:24,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:24,122 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:24,122 INFO L418 AbstractCegarLoop]: === Iteration 778 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:24,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:24,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1353934310, now seen corresponding path program 759 times [2019-08-05 11:12:24,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:24,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:24,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:24,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:24,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:24,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:24,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:24,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:24,291 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:24,358 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2019-08-05 11:12:24,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:24,359 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:24,359 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:12:24,360 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:12:24,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:12:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 123. [2019-08-05 11:12:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:24,364 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:24,364 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:24,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:24,364 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:24,364 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:24,365 INFO L418 AbstractCegarLoop]: === Iteration 779 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:24,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:24,365 INFO L82 PathProgramCache]: Analyzing trace with hash 744608410, now seen corresponding path program 760 times [2019-08-05 11:12:24,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:24,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:24,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:24,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:24,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:24,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:24,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:24,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:24,494 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:24,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:24,563 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:12:24,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:24,564 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:24,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:24,565 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:24,565 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:24,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 127. [2019-08-05 11:12:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:24,568 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:24,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:24,568 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:24,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:24,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:24,569 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:24,569 INFO L418 AbstractCegarLoop]: === Iteration 780 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:24,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:24,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1614373928, now seen corresponding path program 761 times [2019-08-05 11:12:24,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:24,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:24,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:24,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:24,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:24,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:24,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:24,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:24,806 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:24,906 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:12:24,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:24,906 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:24,906 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:24,907 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:24,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 119. [2019-08-05 11:12:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:24,910 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:24,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:24,910 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:24,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:24,910 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:24,910 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:24,910 INFO L418 AbstractCegarLoop]: === Iteration 781 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:24,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:24,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1841965104, now seen corresponding path program 762 times [2019-08-05 11:12:24,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:24,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:24,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:12:25,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:25,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:25,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:25,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:25,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:25,146 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:25,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:25,225 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2019-08-05 11:12:25,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:25,226 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:25,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:25,226 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:12:25,226 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:12:25,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:12:25,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 115. [2019-08-05 11:12:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:25,229 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:25,230 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:25,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:25,230 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:25,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:25,230 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:25,230 INFO L418 AbstractCegarLoop]: === Iteration 782 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:25,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:25,230 INFO L82 PathProgramCache]: Analyzing trace with hash 354459472, now seen corresponding path program 763 times [2019-08-05 11:12:25,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:25,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:25,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:12:25,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:25,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:25,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:25,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:25,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:25,358 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:25,425 INFO L93 Difference]: Finished difference Result 169 states and 208 transitions. [2019-08-05 11:12:25,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:25,425 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:25,426 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:12:25,426 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:12:25,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:12:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 119. [2019-08-05 11:12:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:25,430 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:25,430 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:25,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:25,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:25,430 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:25,431 INFO L418 AbstractCegarLoop]: === Iteration 783 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:25,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:25,431 INFO L82 PathProgramCache]: Analyzing trace with hash 427813914, now seen corresponding path program 764 times [2019-08-05 11:12:25,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:25,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:25,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:25,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:25,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:25,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:25,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:25,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:25,560 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:25,626 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:12:25,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:25,627 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:25,628 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:25,628 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:25,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:25,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 127. [2019-08-05 11:12:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:25,632 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:25,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:25,632 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:25,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:25,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:25,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:25,632 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:25,632 INFO L418 AbstractCegarLoop]: === Iteration 784 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:25,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:25,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1581525486, now seen corresponding path program 765 times [2019-08-05 11:12:25,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:25,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:25,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:25,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:25,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:25,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:25,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:25,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:25,764 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:25,832 INFO L93 Difference]: Finished difference Result 173 states and 213 transitions. [2019-08-05 11:12:25,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:25,833 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:25,834 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:12:25,834 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:12:25,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:12:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 119. [2019-08-05 11:12:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:25,837 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:25,837 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:25,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:25,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:25,838 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:25,838 INFO L418 AbstractCegarLoop]: === Iteration 785 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:25,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:25,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1931168424, now seen corresponding path program 766 times [2019-08-05 11:12:25,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:25,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:25,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:25,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:25,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:25,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:25,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:25,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:25,966 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:26,035 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:26,036 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:26,036 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:26,037 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:26,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-08-05 11:12:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:26,040 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:26,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:26,040 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:26,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:26,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:26,041 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:26,041 INFO L418 AbstractCegarLoop]: === Iteration 786 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:26,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:26,041 INFO L82 PathProgramCache]: Analyzing trace with hash 167374296, now seen corresponding path program 767 times [2019-08-05 11:12:26,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:26,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:26,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:26,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:26,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:26,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:26,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:26,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:26,213 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:26,279 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:12:26,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:26,279 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:26,280 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:26,280 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:26,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:26,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:26,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 119. [2019-08-05 11:12:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:26,284 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:26,284 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:26,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:26,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:26,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:26,285 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:26,285 INFO L418 AbstractCegarLoop]: === Iteration 787 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:26,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:26,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2103359254, now seen corresponding path program 768 times [2019-08-05 11:12:26,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:26,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:26,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:26,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:26,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:26,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:26,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:26,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:26,420 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:26,485 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2019-08-05 11:12:26,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:26,486 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:26,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:26,487 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:12:26,487 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:12:26,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:26,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:12:26,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 103. [2019-08-05 11:12:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:12:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:12:26,490 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:12:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:26,490 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:12:26,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:12:26,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:26,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:26,491 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:26,491 INFO L418 AbstractCegarLoop]: === Iteration 788 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:26,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:26,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1155877468, now seen corresponding path program 769 times [2019-08-05 11:12:26,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:26,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:26,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:26,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:26,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:26,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:26,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:26,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:26,809 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:12:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:26,877 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2019-08-05 11:12:26,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:26,878 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:26,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:26,879 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:26,879 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:26,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:26,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 119. [2019-08-05 11:12:26,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:26,883 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:26,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:26,883 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:26,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:26,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:26,883 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:26,884 INFO L418 AbstractCegarLoop]: === Iteration 789 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:26,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:26,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1203104870, now seen corresponding path program 770 times [2019-08-05 11:12:26,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:26,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:26,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:27,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:27,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:27,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:27,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:27,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:27,016 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:27,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:27,086 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:12:27,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:27,087 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:27,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:27,088 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:27,088 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:27,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 115. [2019-08-05 11:12:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:27,092 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:27,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:27,092 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:27,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:27,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:27,092 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:27,093 INFO L418 AbstractCegarLoop]: === Iteration 790 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:27,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:27,093 INFO L82 PathProgramCache]: Analyzing trace with hash 895437850, now seen corresponding path program 771 times [2019-08-05 11:12:27,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:27,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:27,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:27,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:27,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:27,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:27,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:27,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:27,226 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:27,296 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:27,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:27,297 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:27,298 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:27,298 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:27,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:27,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:27,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 119. [2019-08-05 11:12:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:27,302 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:27,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:27,302 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:27,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:27,302 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:27,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:27,303 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:27,303 INFO L418 AbstractCegarLoop]: === Iteration 791 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:27,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:27,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1463544488, now seen corresponding path program 772 times [2019-08-05 11:12:27,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:27,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:27,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:27,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:27,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:27,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:27,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:27,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:27,433 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:27,491 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:27,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:27,492 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:27,493 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:27,493 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:27,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:27,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 111. [2019-08-05 11:12:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:27,497 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:27,497 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:27,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:27,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:27,498 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:27,498 INFO L418 AbstractCegarLoop]: === Iteration 792 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:27,498 INFO L82 PathProgramCache]: Analyzing trace with hash 578643354, now seen corresponding path program 773 times [2019-08-05 11:12:27,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:27,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:27,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:27,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:27,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:27,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:27,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:27,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:27,627 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:27,695 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:27,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:27,695 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:27,696 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:27,696 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:27,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:27,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:27,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 119. [2019-08-05 11:12:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:27,700 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:27,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:27,700 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:27,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:27,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:27,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:27,700 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:27,700 INFO L418 AbstractCegarLoop]: === Iteration 793 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:27,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:27,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1780338984, now seen corresponding path program 774 times [2019-08-05 11:12:27,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:27,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:27,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:27,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:27,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:27,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:27,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:27,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:27,850 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:27,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:27,915 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:27,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:27,915 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:27,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:27,916 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:27,916 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:27,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:27,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-08-05 11:12:27,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:27,920 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:27,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:27,920 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:27,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:27,920 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:27,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:27,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:27,921 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:27,921 INFO L418 AbstractCegarLoop]: === Iteration 794 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:27,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:27,921 INFO L82 PathProgramCache]: Analyzing trace with hash 671253968, now seen corresponding path program 775 times [2019-08-05 11:12:27,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:27,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:27,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:12:28,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:28,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:28,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:28,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:28,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:28,050 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:28,109 INFO L93 Difference]: Finished difference Result 189 states and 233 transitions. [2019-08-05 11:12:28,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:28,110 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:28,111 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:12:28,111 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:12:28,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:12:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 123. [2019-08-05 11:12:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:28,114 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:28,114 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:28,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:28,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:28,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:28,115 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:28,115 INFO L418 AbstractCegarLoop]: === Iteration 795 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:28,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:28,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1264730990, now seen corresponding path program 776 times [2019-08-05 11:12:28,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:28,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:28,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:28,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:28,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:28,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:28,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:28,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:28,244 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:28,303 INFO L93 Difference]: Finished difference Result 189 states and 233 transitions. [2019-08-05 11:12:28,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:28,303 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:28,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:28,304 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:12:28,304 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:12:28,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:12:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 119. [2019-08-05 11:12:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:28,307 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:28,307 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:28,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:28,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:28,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:28,308 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:28,308 INFO L418 AbstractCegarLoop]: === Iteration 796 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:28,308 INFO L82 PathProgramCache]: Analyzing trace with hash 318203736, now seen corresponding path program 777 times [2019-08-05 11:12:28,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:28,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:28,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:28,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:28,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:28,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:28,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:28,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:28,442 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:28,511 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:28,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:28,511 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:28,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:28,512 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:28,512 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:28,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:28,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 123. [2019-08-05 11:12:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:28,516 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:28,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:28,516 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:28,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:28,516 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:28,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:28,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:28,516 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:28,517 INFO L418 AbstractCegarLoop]: === Iteration 797 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:28,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:28,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2040778602, now seen corresponding path program 778 times [2019-08-05 11:12:28,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:28,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:28,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:28,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:28,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:28,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:28,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:28,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:28,653 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:28,719 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:28,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:28,720 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:28,720 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:28,721 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:28,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 111. [2019-08-05 11:12:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:28,724 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:28,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:28,724 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:28,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:28,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:28,725 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:28,725 INFO L418 AbstractCegarLoop]: === Iteration 798 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:28,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:28,725 INFO L82 PathProgramCache]: Analyzing trace with hash -2146091494, now seen corresponding path program 779 times [2019-08-05 11:12:28,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:28,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:28,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:28,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:28,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:28,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:28,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:28,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:28,858 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:28,920 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:28,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:28,921 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:28,922 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:28,922 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:28,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:28,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:28,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 123. [2019-08-05 11:12:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:28,925 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:28,925 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:28,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:28,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:28,926 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:28,926 INFO L418 AbstractCegarLoop]: === Iteration 799 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:28,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:28,926 INFO L82 PathProgramCache]: Analyzing trace with hash -210106536, now seen corresponding path program 780 times [2019-08-05 11:12:28,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:28,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:28,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:29,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:29,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:29,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:29,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:29,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:29,060 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:29,128 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:29,129 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:29,129 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:29,130 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:29,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:29,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 119. [2019-08-05 11:12:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:29,133 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:29,133 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:29,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:29,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:29,134 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:29,134 INFO L418 AbstractCegarLoop]: === Iteration 800 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:29,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:29,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1888436184, now seen corresponding path program 781 times [2019-08-05 11:12:29,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:29,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:29,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:29,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:29,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:29,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:29,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:29,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:29,267 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:29,339 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:29,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:29,339 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:29,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:29,340 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:29,340 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:29,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:29,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:29,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 123. [2019-08-05 11:12:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:29,343 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:29,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:29,344 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:29,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:29,344 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:29,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:29,344 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:29,344 INFO L418 AbstractCegarLoop]: === Iteration 801 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:29,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:29,344 INFO L82 PathProgramCache]: Analyzing trace with hash -470546154, now seen corresponding path program 782 times [2019-08-05 11:12:29,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:29,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:29,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:29,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:29,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:29,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:29,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:29,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:29,475 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:29,538 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:29,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:29,538 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:29,539 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:29,539 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:29,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:29,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 115. [2019-08-05 11:12:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:29,543 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:29,543 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:29,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:29,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:29,544 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:29,544 INFO L418 AbstractCegarLoop]: === Iteration 802 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:29,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:29,544 INFO L82 PathProgramCache]: Analyzing trace with hash 931693586, now seen corresponding path program 783 times [2019-08-05 11:12:29,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:29,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:29,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:29,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:29,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:29,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:29,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:29,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:29,667 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:29,731 INFO L93 Difference]: Finished difference Result 185 states and 228 transitions. [2019-08-05 11:12:29,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:29,731 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:29,732 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:12:29,732 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:12:29,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:29,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:12:29,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 119. [2019-08-05 11:12:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:29,736 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:29,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:29,736 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:29,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:29,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:29,736 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:29,737 INFO L418 AbstractCegarLoop]: === Iteration 803 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:29,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:29,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1571641688, now seen corresponding path program 784 times [2019-08-05 11:12:29,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:29,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:29,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:30,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:30,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:30,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:30,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:30,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:30,165 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:30,246 INFO L93 Difference]: Finished difference Result 221 states and 274 transitions. [2019-08-05 11:12:30,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:30,246 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:30,247 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:12:30,247 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:12:30,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:12:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 127. [2019-08-05 11:12:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:30,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:30,251 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,251 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:30,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:30,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,252 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:30,252 INFO L418 AbstractCegarLoop]: === Iteration 804 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1004291372, now seen corresponding path program 785 times [2019-08-05 11:12:30,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:30,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:30,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:30,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:30,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:30,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:30,386 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:30,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:30,463 INFO L93 Difference]: Finished difference Result 185 states and 228 transitions. [2019-08-05 11:12:30,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:30,464 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:30,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:30,465 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:12:30,465 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:12:30,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:30,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:12:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 115. [2019-08-05 11:12:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:30,469 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,469 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:30,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:30,470 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:30,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,470 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:30,470 INFO L418 AbstractCegarLoop]: === Iteration 805 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,471 INFO L82 PathProgramCache]: Analyzing trace with hash -787340650, now seen corresponding path program 786 times [2019-08-05 11:12:30,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,609 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:30,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:30,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:30,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:30,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:30,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:30,610 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:30,667 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:30,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:30,667 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:30,668 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:30,668 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:30,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:30,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 111. [2019-08-05 11:12:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:30,672 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,672 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:30,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:30,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,673 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:30,673 INFO L418 AbstractCegarLoop]: === Iteration 806 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1311202070, now seen corresponding path program 787 times [2019-08-05 11:12:30,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:30,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:30,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:30,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:30,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:30,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:30,797 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:30,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:30,864 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2019-08-05 11:12:30,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:30,865 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:30,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:30,865 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:12:30,866 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:12:30,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:12:30,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 115. [2019-08-05 11:12:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:30,869 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,870 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:30,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:30,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,870 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:30,870 INFO L418 AbstractCegarLoop]: === Iteration 807 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1047780268, now seen corresponding path program 788 times [2019-08-05 11:12:30,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:31,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:31,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:31,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:31,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:31,002 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,069 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2019-08-05 11:12:31,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:31,069 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:31,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,070 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:31,070 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:31,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 95. [2019-08-05 11:12:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:12:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-08-05 11:12:31,073 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 68 [2019-08-05 11:12:31,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,073 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-08-05 11:12:31,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-08-05 11:12:31,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:31,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,074 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:31,074 INFO L418 AbstractCegarLoop]: === Iteration 808 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1865925340, now seen corresponding path program 789 times [2019-08-05 11:12:31,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:31,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:31,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:31,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:31,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:31,200 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 21 states. [2019-08-05 11:12:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,261 INFO L93 Difference]: Finished difference Result 187 states and 231 transitions. [2019-08-05 11:12:31,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:31,262 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,263 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:12:31,263 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:12:31,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:12:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 115. [2019-08-05 11:12:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:31,266 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:31,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,267 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:31,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:31,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:31,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,267 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:31,267 INFO L418 AbstractCegarLoop]: === Iteration 809 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,267 INFO L82 PathProgramCache]: Analyzing trace with hash -493056998, now seen corresponding path program 790 times [2019-08-05 11:12:31,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,397 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:31,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:31,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:31,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:31,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:31,398 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,461 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2019-08-05 11:12:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:31,462 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,462 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:31,463 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:31,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:31,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 111. [2019-08-05 11:12:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:31,466 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,466 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:31,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:31,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:31,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,467 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:31,467 INFO L418 AbstractCegarLoop]: === Iteration 810 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1605485722, now seen corresponding path program 791 times [2019-08-05 11:12:31,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:31,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:31,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:31,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:31,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:31,592 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,658 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:31,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:31,658 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,659 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:31,659 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:31,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:31,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 115. [2019-08-05 11:12:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:31,663 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,663 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:31,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:31,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,664 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:31,664 INFO L418 AbstractCegarLoop]: === Iteration 811 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,664 INFO L82 PathProgramCache]: Analyzing trace with hash -753496616, now seen corresponding path program 792 times [2019-08-05 11:12:31,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:31,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:31,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:31,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:31,807 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,870 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:31,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:31,871 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,871 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:31,871 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:31,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:31,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 107. [2019-08-05 11:12:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:12:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:12:31,875 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:12:31,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,875 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:12:31,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:12:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:31,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,876 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:31,876 INFO L418 AbstractCegarLoop]: === Iteration 812 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1288691226, now seen corresponding path program 793 times [2019-08-05 11:12:31,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:32,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:32,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:32,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:32,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:32,009 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:12:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,078 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:32,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:32,079 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:32,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,079 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:32,080 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:32,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:32,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 115. [2019-08-05 11:12:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:32,083 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,083 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:32,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:32,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:32,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,083 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:32,084 INFO L418 AbstractCegarLoop]: === Iteration 813 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1070291112, now seen corresponding path program 794 times [2019-08-05 11:12:32,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:32,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:32,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:32,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:32,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:32,211 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,288 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:32,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:32,288 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:32,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,289 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:32,289 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:32,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:32,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 111. [2019-08-05 11:12:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:32,293 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,293 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:32,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:32,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:32,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,293 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:32,293 INFO L418 AbstractCegarLoop]: === Iteration 814 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1028251608, now seen corresponding path program 795 times [2019-08-05 11:12:32,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:32,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:32,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:32,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:32,416 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,483 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:32,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:32,483 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,484 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:32,484 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:32,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 115. [2019-08-05 11:12:32,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:32,487 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,487 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:32,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:32,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,488 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:32,488 INFO L418 AbstractCegarLoop]: === Iteration 815 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1330730730, now seen corresponding path program 796 times [2019-08-05 11:12:32,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:32,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:32,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:32,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:32,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:32,619 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,693 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:32,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:32,693 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,694 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:32,694 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:32,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:32,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 103. [2019-08-05 11:12:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:12:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:12:32,697 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:12:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,698 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:12:32,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:12:32,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:32,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,698 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:32,698 INFO L418 AbstractCegarLoop]: === Iteration 816 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,699 INFO L82 PathProgramCache]: Analyzing trace with hash -898978480, now seen corresponding path program 797 times [2019-08-05 11:12:32,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:12:32,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:32,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:32,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:32,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:32,837 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:12:32,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,909 INFO L93 Difference]: Finished difference Result 189 states and 233 transitions. [2019-08-05 11:12:32,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:32,909 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:32,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,910 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:12:32,910 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:12:32,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:12:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 115. [2019-08-05 11:12:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:32,914 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:32,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,914 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:32,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:32,914 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:32,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,915 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:32,915 INFO L418 AbstractCegarLoop]: === Iteration 817 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1436043622, now seen corresponding path program 798 times [2019-08-05 11:12:32,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:33,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:33,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:33,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:33,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:33,049 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,119 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:33,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:33,119 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:33,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,120 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:33,120 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:33,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 127. [2019-08-05 11:12:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:33,124 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,124 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:33,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:33,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,125 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:33,125 INFO L418 AbstractCegarLoop]: === Iteration 818 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1460003858, now seen corresponding path program 799 times [2019-08-05 11:12:33,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:33,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:33,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:33,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:33,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:33,251 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,318 INFO L93 Difference]: Finished difference Result 209 states and 258 transitions. [2019-08-05 11:12:33,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:33,318 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:33,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,319 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:33,319 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:33,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:33,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 123. [2019-08-05 11:12:33,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:33,323 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:33,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,323 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:33,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:33,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,324 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:33,324 INFO L418 AbstractCegarLoop]: === Iteration 819 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,324 INFO L82 PathProgramCache]: Analyzing trace with hash 499941336, now seen corresponding path program 800 times [2019-08-05 11:12:33,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:33,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:33,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:33,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:33,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:33,455 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,524 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:33,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:33,524 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,525 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:33,525 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:33,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:33,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 119. [2019-08-05 11:12:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:33,529 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,529 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:33,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:33,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,530 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:33,530 INFO L418 AbstractCegarLoop]: === Iteration 820 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1696483240, now seen corresponding path program 801 times [2019-08-05 11:12:33,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:33,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:33,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:33,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:33,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:33,659 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,730 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2019-08-05 11:12:33,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:33,731 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,732 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:12:33,732 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:12:33,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:33,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:12:33,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2019-08-05 11:12:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:33,735 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,735 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:33,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:33,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,736 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:33,736 INFO L418 AbstractCegarLoop]: === Iteration 821 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,736 INFO L82 PathProgramCache]: Analyzing trace with hash -638538862, now seen corresponding path program 802 times [2019-08-05 11:12:33,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:33,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:33,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:33,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:33,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:33,869 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,940 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2019-08-05 11:12:33,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:33,941 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,942 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:12:33,942 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:12:33,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:12:33,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 127. [2019-08-05 11:12:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:33,945 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,945 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:33,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:33,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,946 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:33,946 INFO L418 AbstractCegarLoop]: === Iteration 822 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,946 INFO L82 PathProgramCache]: Analyzing trace with hash 239501718, now seen corresponding path program 803 times [2019-08-05 11:12:33,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:34,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:34,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:34,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:34,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:34,073 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:34,144 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:34,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:34,145 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:34,146 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:34,146 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:34,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:34,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 119. [2019-08-05 11:12:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:34,149 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:34,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:34,149 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:34,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:34,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:34,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:34,150 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:34,150 INFO L418 AbstractCegarLoop]: === Iteration 823 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:34,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:34,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2013277736, now seen corresponding path program 804 times [2019-08-05 11:12:34,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:34,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:34,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:34,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:34,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:34,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:34,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:34,285 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:34,354 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:34,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:34,354 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:34,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:34,355 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:34,355 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:34,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 127. [2019-08-05 11:12:34,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:34,359 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:34,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:34,359 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:34,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:34,359 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:34,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:34,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:34,359 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:34,359 INFO L418 AbstractCegarLoop]: === Iteration 824 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:34,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:34,360 INFO L82 PathProgramCache]: Analyzing trace with hash -77292778, now seen corresponding path program 805 times [2019-08-05 11:12:34,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:34,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:34,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:34,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:34,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:34,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:34,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:34,494 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:34,568 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:34,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:34,569 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:34,570 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:34,570 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:34,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 123. [2019-08-05 11:12:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:34,573 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:34,574 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:34,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:34,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:34,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:34,574 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:34,574 INFO L418 AbstractCegarLoop]: === Iteration 825 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:34,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:34,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2021249942, now seen corresponding path program 806 times [2019-08-05 11:12:34,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:34,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:34,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:34,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:34,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:34,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:34,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:34,699 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:34,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:34,763 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:34,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:34,763 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:34,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:34,764 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:34,764 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:34,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 127. [2019-08-05 11:12:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:34,768 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:34,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:34,768 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:34,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:34,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:34,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:34,768 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:34,768 INFO L418 AbstractCegarLoop]: === Iteration 826 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:34,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:34,769 INFO L82 PathProgramCache]: Analyzing trace with hash -337732396, now seen corresponding path program 807 times [2019-08-05 11:12:34,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:34,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:34,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:34,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:34,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:34,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:34,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:34,901 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,044 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:35,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:35,044 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:35,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,045 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:35,045 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:35,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 111. [2019-08-05 11:12:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:35,049 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,049 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:35,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:35,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,050 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:35,050 INFO L418 AbstractCegarLoop]: === Iteration 827 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1285214182, now seen corresponding path program 808 times [2019-08-05 11:12:35,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:35,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:35,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:35,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:35,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:35,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:35,490 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,561 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:35,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:35,561 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,562 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:35,562 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:35,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 127. [2019-08-05 11:12:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:35,566 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,566 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:35,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:35,567 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,567 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:35,567 INFO L418 AbstractCegarLoop]: === Iteration 828 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,567 INFO L82 PathProgramCache]: Analyzing trace with hash 650770776, now seen corresponding path program 809 times [2019-08-05 11:12:35,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:35,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:35,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:35,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:35,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:35,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:35,702 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,772 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:35,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:35,773 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:35,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,774 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:35,782 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:35,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 123. [2019-08-05 11:12:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:35,785 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,785 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:35,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:35,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,786 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:35,786 INFO L418 AbstractCegarLoop]: === Iteration 829 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1545653800, now seen corresponding path program 810 times [2019-08-05 11:12:35,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:35,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:35,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:35,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:35,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:35,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:35,912 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,975 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:35,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:35,976 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:35,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,977 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:35,977 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:35,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:35,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:35,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 127. [2019-08-05 11:12:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:35,981 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,981 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:35,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:35,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:35,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,981 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:35,981 INFO L418 AbstractCegarLoop]: === Iteration 830 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,982 INFO L82 PathProgramCache]: Analyzing trace with hash 390331158, now seen corresponding path program 811 times [2019-08-05 11:12:35,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:36,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:36,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:36,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:36,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:36,117 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:36,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,191 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:36,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:36,191 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:36,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,192 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:36,192 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:36,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 119. [2019-08-05 11:12:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:36,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:36,196 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,196 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:36,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:36,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:36,196 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,197 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:36,197 INFO L418 AbstractCegarLoop]: === Iteration 831 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1862448296, now seen corresponding path program 812 times [2019-08-05 11:12:36,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:36,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:36,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:36,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:36,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:36,319 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,383 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:36,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:36,384 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,384 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:36,385 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:36,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 127. [2019-08-05 11:12:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:36,388 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,388 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:36,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:36,388 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:36,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,389 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:36,389 INFO L418 AbstractCegarLoop]: === Iteration 832 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,389 INFO L82 PathProgramCache]: Analyzing trace with hash 73536662, now seen corresponding path program 813 times [2019-08-05 11:12:36,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:36,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:36,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:36,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:36,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:36,521 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,592 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:36,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:36,593 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,594 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:36,594 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:36,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 123. [2019-08-05 11:12:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:36,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:36,597 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:36,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,598 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:36,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:36,598 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:36,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,598 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:36,598 INFO L418 AbstractCegarLoop]: === Iteration 833 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2122887914, now seen corresponding path program 814 times [2019-08-05 11:12:36,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:36,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:36,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:36,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:36,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:36,730 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,798 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:36,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:36,799 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,800 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:36,800 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:36,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 127. [2019-08-05 11:12:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:36,803 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,803 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:36,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:36,803 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,804 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:36,804 INFO L418 AbstractCegarLoop]: === Iteration 834 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,804 INFO L82 PathProgramCache]: Analyzing trace with hash -186902956, now seen corresponding path program 815 times [2019-08-05 11:12:36,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:36,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:36,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:36,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:36,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:36,934 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,003 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:37,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:37,004 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,004 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:37,005 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:37,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:37,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:37,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-08-05 11:12:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:37,009 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,009 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:37,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:37,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,009 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:37,009 INFO L418 AbstractCegarLoop]: === Iteration 835 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,010 INFO L82 PathProgramCache]: Analyzing trace with hash -292215848, now seen corresponding path program 816 times [2019-08-05 11:12:37,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:37,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:37,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:37,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:37,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:37,141 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,209 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:12:37,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:37,210 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,210 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:37,211 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:37,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 127. [2019-08-05 11:12:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:37,215 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:37,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,215 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:37,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:37,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,216 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:37,216 INFO L418 AbstractCegarLoop]: === Iteration 836 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1643769110, now seen corresponding path program 817 times [2019-08-05 11:12:37,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:37,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:37,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:37,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:37,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:37,338 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,408 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:12:37,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:37,408 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,409 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:37,409 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:37,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 123. [2019-08-05 11:12:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:37,413 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:37,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,413 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:37,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:37,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:37,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,414 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:37,414 INFO L418 AbstractCegarLoop]: === Iteration 837 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1720443476, now seen corresponding path program 818 times [2019-08-05 11:12:37,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:37,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:37,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:37,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:37,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:37,545 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,619 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2019-08-05 11:12:37,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:37,619 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,620 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:37,620 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:37,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 115. [2019-08-05 11:12:37,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:37,624 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:37,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,624 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:37,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:37,624 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:37,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,625 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:37,625 INFO L418 AbstractCegarLoop]: === Iteration 838 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,625 INFO L82 PathProgramCache]: Analyzing trace with hash -552655466, now seen corresponding path program 819 times [2019-08-05 11:12:37,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:37,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:37,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:37,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:37,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:37,755 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,822 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:37,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:37,822 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,823 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:37,823 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:37,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:37,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 119. [2019-08-05 11:12:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:37,827 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:37,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,827 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:37,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:37,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,828 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:37,828 INFO L418 AbstractCegarLoop]: === Iteration 839 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1383329492, now seen corresponding path program 820 times [2019-08-05 11:12:37,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:37,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:37,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:37,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:37,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:37,962 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,028 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:38,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:38,028 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:38,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,029 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:38,029 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:38,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:38,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 111. [2019-08-05 11:12:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:38,032 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,033 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:38,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:38,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,033 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:38,033 INFO L418 AbstractCegarLoop]: === Iteration 840 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,033 INFO L82 PathProgramCache]: Analyzing trace with hash -321744366, now seen corresponding path program 821 times [2019-08-05 11:12:38,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:38,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:38,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:38,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:38,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:38,168 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,240 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2019-08-05 11:12:38,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:38,241 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,242 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:38,242 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:38,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 119. [2019-08-05 11:12:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:38,245 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,246 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:38,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:38,246 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:38,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,246 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:38,246 INFO L418 AbstractCegarLoop]: === Iteration 841 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2037237972, now seen corresponding path program 822 times [2019-08-05 11:12:38,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:38,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:38,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:38,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:38,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:38,389 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,458 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2019-08-05 11:12:38,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:38,458 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,459 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:38,459 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:38,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 115. [2019-08-05 11:12:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:38,462 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:38,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,462 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:38,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:38,463 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:38,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:38,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,463 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:38,463 INFO L418 AbstractCegarLoop]: === Iteration 842 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,463 INFO L82 PathProgramCache]: Analyzing trace with hash -869449962, now seen corresponding path program 823 times [2019-08-05 11:12:38,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:38,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:38,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:38,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:38,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:38,591 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,653 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:38,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:38,653 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:38,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,654 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:38,654 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:38,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 123. [2019-08-05 11:12:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:38,658 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,658 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:38,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:38,658 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:38,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,658 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:38,659 INFO L418 AbstractCegarLoop]: === Iteration 843 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1066534996, now seen corresponding path program 824 times [2019-08-05 11:12:38,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:38,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:38,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:38,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:38,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:38,807 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,873 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:38,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:38,874 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,875 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:38,875 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:38,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 119. [2019-08-05 11:12:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:38,879 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:38,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,879 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:38,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:38,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,879 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:38,879 INFO L418 AbstractCegarLoop]: === Iteration 844 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,880 INFO L82 PathProgramCache]: Analyzing trace with hash -61304748, now seen corresponding path program 825 times [2019-08-05 11:12:38,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:39,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:39,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:39,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:39,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:39,050 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:39,119 INFO L93 Difference]: Finished difference Result 201 states and 248 transitions. [2019-08-05 11:12:39,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:39,120 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:39,121 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:39,121 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:39,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 123. [2019-08-05 11:12:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:39,124 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:39,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:39,124 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:39,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:39,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:39,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:39,125 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:39,125 INFO L418 AbstractCegarLoop]: === Iteration 845 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:39,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:39,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1129889580, now seen corresponding path program 826 times [2019-08-05 11:12:39,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:39,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:39,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,252 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:39,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:39,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:39,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:39,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:39,253 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:39,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:39,318 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:12:39,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:39,318 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:39,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:39,319 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:39,319 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:39,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:39,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 127. [2019-08-05 11:12:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:39,323 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:39,323 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:39,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:39,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:39,324 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:39,324 INFO L418 AbstractCegarLoop]: === Iteration 846 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:39,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:39,324 INFO L82 PathProgramCache]: Analyzing trace with hash 806095378, now seen corresponding path program 827 times [2019-08-05 11:12:39,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:39,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:39,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:39,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:39,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:39,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:39,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:39,453 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:39,517 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2019-08-05 11:12:39,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:39,518 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:39,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:39,518 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:39,519 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:39,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:39,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 103. [2019-08-05 11:12:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:12:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:12:39,522 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:12:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:39,522 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:12:39,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:12:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:39,522 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:39,523 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:39,523 INFO L418 AbstractCegarLoop]: === Iteration 847 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:39,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:39,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1797481380, now seen corresponding path program 828 times [2019-08-05 11:12:39,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:39,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:39,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:39,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:39,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:39,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:39,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:39,649 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:12:39,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:39,711 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2019-08-05 11:12:39,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:39,712 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:39,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:39,713 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:39,713 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:39,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:39,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 127. [2019-08-05 11:12:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:39,716 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:39,716 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:39,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:39,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:39,717 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:39,717 INFO L418 AbstractCegarLoop]: === Iteration 848 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:39,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:39,717 INFO L82 PathProgramCache]: Analyzing trace with hash 138503578, now seen corresponding path program 829 times [2019-08-05 11:12:39,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:39,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:39,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:39,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:39,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:39,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:39,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:39,852 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:39,944 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:12:39,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:39,944 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:39,944 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:39,945 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:39,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 123. [2019-08-05 11:12:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:39,948 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:39,948 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:39,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:39,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:39,948 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:39,948 INFO L418 AbstractCegarLoop]: === Iteration 849 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:39,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:39,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2057920998, now seen corresponding path program 830 times [2019-08-05 11:12:39,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:39,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:39,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:40,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:40,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:40,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:40,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:40,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:40,226 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:40,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,345 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:12:40,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:40,346 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,347 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:40,347 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:40,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 127. [2019-08-05 11:12:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:40,350 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:40,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,350 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:40,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:40,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,351 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:40,351 INFO L418 AbstractCegarLoop]: === Iteration 850 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,351 INFO L82 PathProgramCache]: Analyzing trace with hash -121936040, now seen corresponding path program 831 times [2019-08-05 11:12:40,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:40,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:40,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:40,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:40,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:40,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:40,491 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,559 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:12:40,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:40,559 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,560 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:40,560 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:40,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 119. [2019-08-05 11:12:40,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:40,564 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:40,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,564 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:40,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:40,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,564 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:40,564 INFO L418 AbstractCegarLoop]: === Iteration 851 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1920251802, now seen corresponding path program 832 times [2019-08-05 11:12:40,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:40,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:40,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:40,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:40,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:40,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:40,691 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,762 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:12:40,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:40,762 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,763 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:40,763 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:40,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 127. [2019-08-05 11:12:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:40,767 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,767 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:40,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:40,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,768 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:40,768 INFO L418 AbstractCegarLoop]: === Iteration 852 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1997289706, now seen corresponding path program 833 times [2019-08-05 11:12:40,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:40,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:40,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:40,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:40,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:40,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:40,892 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:40,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,956 INFO L93 Difference]: Finished difference Result 201 states and 248 transitions. [2019-08-05 11:12:40,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:40,956 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:40,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,957 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:40,957 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:40,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 111. [2019-08-05 11:12:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:40,960 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,960 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:40,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:40,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,961 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:40,961 INFO L418 AbstractCegarLoop]: === Iteration 853 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,961 INFO L82 PathProgramCache]: Analyzing trace with hash -438730536, now seen corresponding path program 834 times [2019-08-05 11:12:40,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:41,119 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:41,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:41,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:41,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:41,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:41,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:41,120 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:41,292 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:41,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:41,292 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:41,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:41,293 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:41,293 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:41,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 107. [2019-08-05 11:12:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:12:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:12:41,297 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:12:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:41,297 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:12:41,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:12:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:41,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:41,298 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:41,298 INFO L418 AbstractCegarLoop]: === Iteration 854 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:41,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:41,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1659812184, now seen corresponding path program 835 times [2019-08-05 11:12:41,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:41,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:41,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:41,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:41,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:41,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:41,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:41,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:41,430 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:12:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:41,499 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:41,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:41,499 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:41,500 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:41,500 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:41,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:41,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 111. [2019-08-05 11:12:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:41,503 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:41,503 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:41,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:41,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:41,504 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:41,504 INFO L418 AbstractCegarLoop]: === Iteration 855 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:41,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:41,504 INFO L82 PathProgramCache]: Analyzing trace with hash -699170154, now seen corresponding path program 836 times [2019-08-05 11:12:41,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:41,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:41,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:41,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:41,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:41,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:41,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:41,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:41,634 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:41,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:41,701 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:41,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:41,701 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:41,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:41,702 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:41,702 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:41,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 99. [2019-08-05 11:12:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:12:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:12:41,705 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:12:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:41,706 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:12:41,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:12:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:41,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:41,706 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:41,706 INFO L418 AbstractCegarLoop]: === Iteration 856 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:41,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1049807920, now seen corresponding path program 837 times [2019-08-05 11:12:41,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:41,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:41,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:12:41,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:41,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:41,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:41,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:41,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:41,838 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:12:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:41,898 INFO L93 Difference]: Finished difference Result 185 states and 228 transitions. [2019-08-05 11:12:41,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:41,898 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:41,899 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:12:41,899 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:12:41,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:12:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 115. [2019-08-05 11:12:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:41,903 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:41,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:41,903 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:41,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:41,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:41,903 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:41,904 INFO L418 AbstractCegarLoop]: === Iteration 857 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:41,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:41,904 INFO L82 PathProgramCache]: Analyzing trace with hash -804483046, now seen corresponding path program 838 times [2019-08-05 11:12:41,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:41,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:41,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:42,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:42,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:42,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:42,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:42,035 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:42,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:42,100 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:42,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:42,101 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:42,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:42,102 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:42,102 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:42,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 127. [2019-08-05 11:12:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:42,106 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:42,106 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:42,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:42,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:42,106 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:42,106 INFO L418 AbstractCegarLoop]: === Iteration 858 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:42,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1131501912, now seen corresponding path program 839 times [2019-08-05 11:12:42,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:42,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:42,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:42,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:42,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:42,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:42,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:42,241 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:42,305 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:42,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:42,306 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:42,307 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:42,307 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:42,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:42,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 123. [2019-08-05 11:12:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:42,310 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:42,311 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:42,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:42,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:42,311 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:42,311 INFO L418 AbstractCegarLoop]: === Iteration 859 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:42,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:42,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1064922664, now seen corresponding path program 840 times [2019-08-05 11:12:42,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:42,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:42,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:42,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:42,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:42,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:42,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:42,437 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:42,507 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:42,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:42,507 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:42,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:42,508 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:42,508 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:42,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:42,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 127. [2019-08-05 11:12:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:42,512 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:42,512 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:42,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:42,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:42,513 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:42,513 INFO L418 AbstractCegarLoop]: === Iteration 860 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash 871062294, now seen corresponding path program 841 times [2019-08-05 11:12:42,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:42,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:42,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:42,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:42,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:42,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:42,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:42,640 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:42,705 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:42,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:42,706 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:42,707 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:42,707 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:42,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 119. [2019-08-05 11:12:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:42,711 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:42,711 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:42,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:42,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:42,712 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:42,712 INFO L418 AbstractCegarLoop]: === Iteration 861 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:42,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:42,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1381717160, now seen corresponding path program 842 times [2019-08-05 11:12:42,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:42,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:42,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:42,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:42,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:42,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:42,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:42,840 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:42,914 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:42,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:42,914 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:42,915 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:42,915 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:42,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:42,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 127. [2019-08-05 11:12:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:42,919 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:42,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:42,919 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:42,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:42,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:42,920 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:42,920 INFO L418 AbstractCegarLoop]: === Iteration 862 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:42,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:42,920 INFO L82 PathProgramCache]: Analyzing trace with hash 554267798, now seen corresponding path program 843 times [2019-08-05 11:12:42,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:42,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:42,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:43,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:43,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:43,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:43,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:43,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:43,072 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:43,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:43,150 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:43,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:43,150 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:43,151 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:43,151 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:43,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 123. [2019-08-05 11:12:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:43,154 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:43,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:43,154 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:43,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:43,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:43,154 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:43,155 INFO L418 AbstractCegarLoop]: === Iteration 863 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:43,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:43,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1642156778, now seen corresponding path program 844 times [2019-08-05 11:12:43,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:43,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:43,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:43,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:43,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:43,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:43,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:43,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:43,296 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:43,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:43,365 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:43,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:43,366 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:43,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:43,366 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:43,367 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:43,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 127. [2019-08-05 11:12:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:43,370 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:43,370 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:43,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:43,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:43,371 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:43,371 INFO L418 AbstractCegarLoop]: === Iteration 864 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:43,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:43,371 INFO L82 PathProgramCache]: Analyzing trace with hash 293828180, now seen corresponding path program 845 times [2019-08-05 11:12:43,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:43,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:43,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:43,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:43,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:43,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:43,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:43,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:43,503 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:43,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:43,566 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:43,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:43,567 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:43,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:43,568 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:43,568 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:43,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 111. [2019-08-05 11:12:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:43,572 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:43,572 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:43,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:43,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:43,573 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:43,573 INFO L418 AbstractCegarLoop]: === Iteration 865 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:43,573 INFO L82 PathProgramCache]: Analyzing trace with hash -653653606, now seen corresponding path program 846 times [2019-08-05 11:12:43,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:43,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:43,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:43,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:43,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:43,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:43,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:43,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:43,705 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:43,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:43,762 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:43,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:43,763 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:43,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:43,764 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:43,764 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:43,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:43,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:43,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 127. [2019-08-05 11:12:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:43,768 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:43,768 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:43,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:43,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:43,768 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:43,768 INFO L418 AbstractCegarLoop]: === Iteration 866 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:43,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:43,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1282331352, now seen corresponding path program 847 times [2019-08-05 11:12:43,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:43,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:43,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:44,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:44,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:44,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:44,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:44,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:44,017 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:44,080 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:44,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:44,080 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:44,081 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:44,081 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:44,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:44,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 123. [2019-08-05 11:12:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:44,086 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:44,086 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:44,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:44,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:44,086 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:44,087 INFO L418 AbstractCegarLoop]: === Iteration 867 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:44,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:44,087 INFO L82 PathProgramCache]: Analyzing trace with hash -914093224, now seen corresponding path program 848 times [2019-08-05 11:12:44,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:44,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:44,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:44,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:44,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:44,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:44,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:44,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:44,214 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:44,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:44,283 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:44,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:44,284 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:44,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:44,284 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:44,285 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:44,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:44,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 127. [2019-08-05 11:12:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:44,288 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:44,289 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:44,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:44,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:44,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:44,289 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:44,289 INFO L418 AbstractCegarLoop]: === Iteration 868 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:44,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:44,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1021891734, now seen corresponding path program 849 times [2019-08-05 11:12:44,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:44,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:44,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:44,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:44,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:44,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:44,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:44,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:44,420 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:44,484 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:44,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:44,484 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:44,485 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:44,485 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:44,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 119. [2019-08-05 11:12:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:44,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:44,489 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:44,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:44,489 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:44,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:44,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:44,490 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:44,490 INFO L418 AbstractCegarLoop]: === Iteration 869 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:44,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1230887720, now seen corresponding path program 850 times [2019-08-05 11:12:44,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:44,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:44,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:44,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:44,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:44,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:44,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:44,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:44,617 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:44,690 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:44,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:44,691 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:44,692 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:44,692 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:44,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:44,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 127. [2019-08-05 11:12:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:44,695 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:44,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:44,696 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:44,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:44,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:44,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:44,697 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:44,697 INFO L418 AbstractCegarLoop]: === Iteration 870 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:44,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:44,697 INFO L82 PathProgramCache]: Analyzing trace with hash 705097238, now seen corresponding path program 851 times [2019-08-05 11:12:44,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:44,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:44,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:44,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:44,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:44,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:44,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:44,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:44,868 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:44,936 INFO L93 Difference]: Finished difference Result 211 states and 262 transitions. [2019-08-05 11:12:44,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:44,936 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:44,937 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:44,937 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:44,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 123. [2019-08-05 11:12:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:44,941 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:44,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:44,941 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:44,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:44,941 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:44,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:44,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:44,942 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:44,942 INFO L418 AbstractCegarLoop]: === Iteration 871 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:44,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:44,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1491327338, now seen corresponding path program 852 times [2019-08-05 11:12:44,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:44,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:44,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:45,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:45,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:45,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:45,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:45,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:45,070 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:45,142 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:45,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:45,144 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:45,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:45,144 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:45,144 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:45,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 127. [2019-08-05 11:12:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:45,148 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:45,148 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:45,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:45,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:45,149 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:45,149 INFO L418 AbstractCegarLoop]: === Iteration 872 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:45,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:45,149 INFO L82 PathProgramCache]: Analyzing trace with hash 444657620, now seen corresponding path program 853 times [2019-08-05 11:12:45,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:45,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:45,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:45,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:45,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:45,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:45,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:45,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:45,613 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:45,674 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:45,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:45,675 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:45,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:45,676 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:45,676 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:45,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:45,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:45,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-08-05 11:12:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:45,679 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:45,679 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:45,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:45,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:45,680 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:45,680 INFO L418 AbstractCegarLoop]: === Iteration 873 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:45,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1309174418, now seen corresponding path program 854 times [2019-08-05 11:12:45,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:45,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:45,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:45,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:45,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:45,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:45,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:45,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:45,815 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:45,880 INFO L93 Difference]: Finished difference Result 197 states and 243 transitions. [2019-08-05 11:12:45,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:45,880 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:45,881 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:12:45,881 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:12:45,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:12:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 111. [2019-08-05 11:12:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:45,885 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:45,885 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:45,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:45,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:45,886 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:45,886 INFO L418 AbstractCegarLoop]: === Iteration 874 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:45,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:45,886 INFO L82 PathProgramCache]: Analyzing trace with hash 339344728, now seen corresponding path program 855 times [2019-08-05 11:12:45,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:45,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:45,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:46,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:46,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:46,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:46,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:46,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:46,015 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:46,081 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:46,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:46,081 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:46,082 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:46,082 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:46,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 123. [2019-08-05 11:12:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:46,086 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:46,086 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:46,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:46,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:46,087 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:46,087 INFO L418 AbstractCegarLoop]: === Iteration 875 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:46,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:46,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2019637610, now seen corresponding path program 856 times [2019-08-05 11:12:46,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:46,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:46,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:46,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:46,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:46,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:46,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:46,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:46,215 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:46,284 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:46,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:46,284 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:46,285 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:46,285 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:46,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:46,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:46,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 119. [2019-08-05 11:12:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:46,289 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:46,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:46,289 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:46,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:46,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:46,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:46,290 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:46,290 INFO L418 AbstractCegarLoop]: === Iteration 876 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:46,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:46,290 INFO L82 PathProgramCache]: Analyzing trace with hash 78905110, now seen corresponding path program 857 times [2019-08-05 11:12:46,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:46,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:46,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:46,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:46,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:46,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:46,455 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:46,627 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:46,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:46,628 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:46,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:46,629 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:46,629 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:46,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:46,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 123. [2019-08-05 11:12:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:46,632 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:46,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:46,633 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:46,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:46,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:46,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:46,633 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:46,633 INFO L418 AbstractCegarLoop]: === Iteration 877 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:46,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:46,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2014890068, now seen corresponding path program 858 times [2019-08-05 11:12:46,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:46,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:46,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:46,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:46,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:46,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:46,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:46,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:46,847 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:46,921 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:46,922 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:46,922 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:46,923 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:46,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:46,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 115. [2019-08-05 11:12:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:46,926 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:46,926 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:46,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:46,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:46,927 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:46,927 INFO L418 AbstractCegarLoop]: === Iteration 878 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash -789368302, now seen corresponding path program 859 times [2019-08-05 11:12:46,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:46,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:46,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:47,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:47,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:47,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:47,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:47,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:47,054 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:47,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:47,120 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2019-08-05 11:12:47,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:47,120 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:47,121 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:12:47,122 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:12:47,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:47,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:12:47,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 119. [2019-08-05 11:12:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:47,126 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:47,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:47,126 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:47,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:47,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:47,127 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:47,127 INFO L418 AbstractCegarLoop]: === Iteration 879 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:47,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:47,127 INFO L82 PathProgramCache]: Analyzing trace with hash -237889386, now seen corresponding path program 860 times [2019-08-05 11:12:47,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:47,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:47,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:47,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:47,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:47,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:47,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:47,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:47,280 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:47,346 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:12:47,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:47,347 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:47,348 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:47,348 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:47,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 127. [2019-08-05 11:12:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:47,351 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:47,351 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:47,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:47,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:47,352 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:47,352 INFO L418 AbstractCegarLoop]: === Iteration 880 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:47,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:47,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1698095572, now seen corresponding path program 861 times [2019-08-05 11:12:47,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:47,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:47,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:47,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:47,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:47,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:47,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:47,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:47,477 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:47,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:47,547 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:12:47,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:47,548 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:47,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:47,549 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:47,549 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:47,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 123. [2019-08-05 11:12:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:47,553 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:47,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:47,553 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:47,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:47,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:47,554 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:47,554 INFO L418 AbstractCegarLoop]: === Iteration 881 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1569614036, now seen corresponding path program 862 times [2019-08-05 11:12:47,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:47,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:47,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:48,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:48,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:48,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:48,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:48,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:48,009 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:48,069 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:12:48,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:48,069 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:48,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:48,070 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:48,070 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:48,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 115. [2019-08-05 11:12:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:48,073 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:48,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:48,074 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:48,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:48,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:48,074 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:48,074 INFO L418 AbstractCegarLoop]: === Iteration 882 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:48,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:48,075 INFO L82 PathProgramCache]: Analyzing trace with hash -498329004, now seen corresponding path program 863 times [2019-08-05 11:12:48,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:48,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:48,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:48,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:48,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:48,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:48,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:48,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:48,238 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:48,311 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2019-08-05 11:12:48,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:48,312 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:48,313 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:48,313 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:48,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 119. [2019-08-05 11:12:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:48,317 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:48,317 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:48,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:48,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:48,318 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:48,318 INFO L418 AbstractCegarLoop]: === Iteration 883 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:48,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:48,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1437655954, now seen corresponding path program 864 times [2019-08-05 11:12:48,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:48,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:48,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:48,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:48,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:48,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:48,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:48,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:48,447 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:48,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:48,518 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2019-08-05 11:12:48,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:48,518 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:48,519 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:12:48,519 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:12:48,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:12:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 99. [2019-08-05 11:12:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:12:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:12:48,523 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:12:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:48,523 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:12:48,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:12:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:48,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:48,523 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:48,523 INFO L418 AbstractCegarLoop]: === Iteration 884 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:48,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:48,524 INFO L82 PathProgramCache]: Analyzing trace with hash 56394266, now seen corresponding path program 865 times [2019-08-05 11:12:48,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:48,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:48,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:48,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:48,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:48,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:48,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:48,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:48,658 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:12:48,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:48,729 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2019-08-05 11:12:48,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:48,730 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:48,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:48,730 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:48,731 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:48,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:48,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 119. [2019-08-05 11:12:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:48,734 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:48,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:48,734 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:48,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:48,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:48,735 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:48,735 INFO L418 AbstractCegarLoop]: === Iteration 885 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:48,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:48,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1992379224, now seen corresponding path program 866 times [2019-08-05 11:12:48,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:48,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:48,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:48,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:48,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:48,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:48,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:48,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:48,875 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:48,945 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:12:48,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:48,946 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:48,946 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:48,947 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:48,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 115. [2019-08-05 11:12:48,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:48,950 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:48,950 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:48,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:48,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:48,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:48,951 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:48,951 INFO L418 AbstractCegarLoop]: === Iteration 886 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:48,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash -204045352, now seen corresponding path program 867 times [2019-08-05 11:12:48,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:48,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:48,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:49,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:49,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:49,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:49,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:49,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:49,077 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:49,144 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:49,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:49,144 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:49,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:49,145 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:49,145 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:49,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:49,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 119. [2019-08-05 11:12:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:49,149 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:49,149 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:49,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:49,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:49,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:49,149 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:49,149 INFO L418 AbstractCegarLoop]: === Iteration 887 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:49,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:49,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1731939606, now seen corresponding path program 868 times [2019-08-05 11:12:49,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:49,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:49,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:49,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:49,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:49,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:49,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:49,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:49,275 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:49,340 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:49,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:49,340 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:49,341 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:49,341 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:49,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 111. [2019-08-05 11:12:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:49,345 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:49,345 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:49,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:49,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:49,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:49,345 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:49,345 INFO L418 AbstractCegarLoop]: === Iteration 888 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:49,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:49,346 INFO L82 PathProgramCache]: Analyzing trace with hash -520839848, now seen corresponding path program 869 times [2019-08-05 11:12:49,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:49,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:49,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:49,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:49,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:49,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:49,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:49,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:49,540 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:49,604 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:49,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:49,604 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:49,605 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:49,605 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:49,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 119. [2019-08-05 11:12:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:49,608 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:49,609 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:49,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:49,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:49,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:49,609 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:49,609 INFO L418 AbstractCegarLoop]: === Iteration 889 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:49,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:49,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1415145110, now seen corresponding path program 870 times [2019-08-05 11:12:49,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:49,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:49,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:49,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:49,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:49,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:49,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:49,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:49,743 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:49,825 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:49,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:49,825 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:49,826 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:49,826 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:49,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-08-05 11:12:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:49,830 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:49,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:49,831 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:49,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:49,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:49,831 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:49,831 INFO L418 AbstractCegarLoop]: === Iteration 890 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:49,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash -472573806, now seen corresponding path program 871 times [2019-08-05 11:12:49,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:49,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:49,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:50,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:50,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:50,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:50,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:50,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:50,017 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:50,077 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:12:50,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:50,078 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:50,079 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:50,079 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:50,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 123. [2019-08-05 11:12:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:50,083 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:50,083 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:50,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:50,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:50,083 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:50,083 INFO L418 AbstractCegarLoop]: === Iteration 891 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:50,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:50,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1886408532, now seen corresponding path program 872 times [2019-08-05 11:12:50,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:50,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:50,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:50,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:50,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:50,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:50,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:50,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:50,211 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:50,306 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:12:50,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:50,306 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:50,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:50,306 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:50,307 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:50,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 119. [2019-08-05 11:12:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:50,310 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:50,310 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:50,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:50,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:50,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:50,310 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:50,310 INFO L418 AbstractCegarLoop]: === Iteration 892 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash -781279466, now seen corresponding path program 873 times [2019-08-05 11:12:50,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:50,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:50,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:50,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:50,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:50,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:50,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:50,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:50,716 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:50,782 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:50,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:50,782 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:50,783 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:50,783 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:50,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:50,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 123. [2019-08-05 11:12:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:50,787 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:50,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:50,787 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:50,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:50,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:50,788 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:50,788 INFO L418 AbstractCegarLoop]: === Iteration 893 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:50,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1154705492, now seen corresponding path program 874 times [2019-08-05 11:12:50,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:50,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:50,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:50,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:50,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:50,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:50,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:50,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:50,921 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:50,990 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:12:50,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:50,990 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:50,991 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:12:50,991 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:12:50,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:50,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:12:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 111. [2019-08-05 11:12:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:50,995 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:50,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:50,995 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:50,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:50,995 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:50,995 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:50,996 INFO L418 AbstractCegarLoop]: === Iteration 894 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:50,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:50,996 INFO L82 PathProgramCache]: Analyzing trace with hash -212134188, now seen corresponding path program 875 times [2019-08-05 11:12:50,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:50,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:50,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:51,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:51,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:51,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:51,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:51,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:51,128 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:51,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:51,190 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2019-08-05 11:12:51,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:51,191 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:51,191 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:51,192 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:51,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 115. [2019-08-05 11:12:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:51,195 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:51,195 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:51,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:51,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:51,196 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:51,196 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:51,196 INFO L418 AbstractCegarLoop]: === Iteration 895 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:51,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1049392600, now seen corresponding path program 876 times [2019-08-05 11:12:51,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:51,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:51,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:51,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:51,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:51,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:51,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:51,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:51,324 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:51,420 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:12:51,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:51,420 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:51,421 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:51,421 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:51,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 127. [2019-08-05 11:12:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:51,426 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:51,426 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:51,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:51,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:51,426 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:51,426 INFO L418 AbstractCegarLoop]: === Iteration 896 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:51,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2146848150, now seen corresponding path program 877 times [2019-08-05 11:12:51,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:51,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:51,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:51,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:51,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:51,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:51,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:51,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:51,620 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:51,710 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2019-08-05 11:12:51,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:51,711 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:51,712 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:12:51,712 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:12:51,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:12:51,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 115. [2019-08-05 11:12:51,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:51,715 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:51,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:51,716 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:51,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:51,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:51,716 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:51,717 INFO L418 AbstractCegarLoop]: === Iteration 897 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:51,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:51,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1309589738, now seen corresponding path program 878 times [2019-08-05 11:12:51,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:51,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:51,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:51,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:51,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:51,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:51,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:51,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:51,848 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:51,917 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:51,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:51,918 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:51,919 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:51,919 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:51,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 111. [2019-08-05 11:12:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:51,922 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:51,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:51,922 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:51,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:51,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:51,923 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:51,923 INFO L418 AbstractCegarLoop]: === Iteration 898 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:51,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:51,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2042806254, now seen corresponding path program 879 times [2019-08-05 11:12:51,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:51,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:51,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:52,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:52,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:52,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:52,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:52,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:52,049 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:52,106 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2019-08-05 11:12:52,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:52,106 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:52,107 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:12:52,107 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:12:52,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:52,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:12:52,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 123. [2019-08-05 11:12:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:52,110 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:52,111 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:52,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:52,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:52,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:52,111 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:52,111 INFO L418 AbstractCegarLoop]: === Iteration 899 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:52,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:52,111 INFO L82 PathProgramCache]: Analyzing trace with hash 788952982, now seen corresponding path program 880 times [2019-08-05 11:12:52,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:52,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:52,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:52,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:52,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:52,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:52,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:52,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:52,254 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:52,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:52,325 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:12:52,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:52,326 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:52,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:52,326 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:52,327 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:52,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 127. [2019-08-05 11:12:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:52,331 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:52,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:52,331 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:52,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:52,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:52,332 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:52,332 INFO L418 AbstractCegarLoop]: === Iteration 900 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:52,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:52,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1570029356, now seen corresponding path program 881 times [2019-08-05 11:12:52,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:52,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:52,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:52,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:52,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:52,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:52,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:52,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:52,465 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:52,533 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:12:52,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:52,533 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:52,534 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:52,534 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:52,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 119. [2019-08-05 11:12:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:52,538 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:52,538 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:52,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:52,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:52,539 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:52,539 INFO L418 AbstractCegarLoop]: === Iteration 901 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash 316176084, now seen corresponding path program 882 times [2019-08-05 11:12:52,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:52,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:52,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:52,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:52,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:52,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:52,671 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:52,736 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:12:52,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:52,737 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:52,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:52,738 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:52,738 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:52,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:52,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 115. [2019-08-05 11:12:52,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:52,741 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:52,741 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:52,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:52,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:52,742 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:52,742 INFO L418 AbstractCegarLoop]: === Iteration 902 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:52,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:52,742 INFO L82 PathProgramCache]: Analyzing trace with hash 472158486, now seen corresponding path program 883 times [2019-08-05 11:12:52,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:52,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:52,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:52,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:52,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:52,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:52,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:52,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:52,870 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:52,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:52,946 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:12:52,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:52,946 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:52,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:52,947 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:52,947 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:52,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:52,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 123. [2019-08-05 11:12:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:52,950 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:52,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:52,951 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:52,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:52,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:52,951 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:52,951 INFO L418 AbstractCegarLoop]: === Iteration 903 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:52,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:52,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1782366636, now seen corresponding path program 884 times [2019-08-05 11:12:52,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:52,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:52,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:53,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:53,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:53,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:53,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:53,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:53,111 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:53,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:53,182 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2019-08-05 11:12:53,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:53,182 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:53,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:53,183 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:12:53,183 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:12:53,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:12:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 127. [2019-08-05 11:12:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:53,186 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:53,187 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:53,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:53,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:53,187 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:53,187 INFO L418 AbstractCegarLoop]: === Iteration 904 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:53,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1886823852, now seen corresponding path program 885 times [2019-08-05 11:12:53,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:53,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:53,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:53,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:53,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:53,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:53,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:53,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:53,322 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:53,393 INFO L93 Difference]: Finished difference Result 221 states and 274 transitions. [2019-08-05 11:12:53,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:53,394 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:53,395 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:12:53,395 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:12:53,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:53,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:12:53,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 123. [2019-08-05 11:12:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:53,399 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:53,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:53,399 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:53,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:53,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:53,400 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:53,400 INFO L418 AbstractCegarLoop]: === Iteration 905 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash 211718868, now seen corresponding path program 886 times [2019-08-05 11:12:53,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:53,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:53,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:53,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:53,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:53,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:53,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:53,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:53,552 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:53,624 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2019-08-05 11:12:53,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:53,624 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:53,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:53,625 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:12:53,625 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:12:53,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:53,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:12:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 127. [2019-08-05 11:12:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:53,629 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:53,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:53,629 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:53,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:53,629 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:53,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:53,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:53,630 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:53,630 INFO L418 AbstractCegarLoop]: === Iteration 906 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:53,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:53,630 INFO L82 PathProgramCache]: Analyzing trace with hash 576615702, now seen corresponding path program 887 times [2019-08-05 11:12:53,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:53,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:53,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:53,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:53,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:53,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:53,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:53,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:53,774 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:53,849 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2019-08-05 11:12:53,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:53,849 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:53,850 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:12:53,850 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:12:53,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:12:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 119. [2019-08-05 11:12:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:53,854 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:53,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:53,854 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:53,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:53,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:53,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:53,855 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:53,855 INFO L418 AbstractCegarLoop]: === Iteration 907 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:53,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:53,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2147263470, now seen corresponding path program 888 times [2019-08-05 11:12:53,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:53,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:53,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:54,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:54,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:54,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:54,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:54,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:54,168 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:54,224 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2019-08-05 11:12:54,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:54,225 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:54,225 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:54,226 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:54,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 103. [2019-08-05 11:12:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:12:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:12:54,229 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:12:54,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:54,229 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:12:54,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:54,229 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:12:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:54,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:54,230 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:54,230 INFO L418 AbstractCegarLoop]: === Iteration 908 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:54,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:54,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1200222040, now seen corresponding path program 889 times [2019-08-05 11:12:54,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:54,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:54,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:54,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:54,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:54,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:54,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:54,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:54,352 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:12:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:54,423 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2019-08-05 11:12:54,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:54,424 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:54,425 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:54,425 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:12:54,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:12:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 119. [2019-08-05 11:12:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:54,429 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:54,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:54,429 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:54,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:54,429 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:54,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:54,429 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:54,430 INFO L418 AbstractCegarLoop]: === Iteration 909 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:54,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:54,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1158760298, now seen corresponding path program 890 times [2019-08-05 11:12:54,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:54,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:54,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:54,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:54,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:54,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:54,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:54,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:54,555 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:54,623 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2019-08-05 11:12:54,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:54,624 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:54,624 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:54,625 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:12:54,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:12:54,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 115. [2019-08-05 11:12:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:54,628 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:54,628 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:54,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:54,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:54,629 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:54,629 INFO L418 AbstractCegarLoop]: === Iteration 910 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:54,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:54,629 INFO L82 PathProgramCache]: Analyzing trace with hash 939782422, now seen corresponding path program 891 times [2019-08-05 11:12:54,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:54,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:54,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:54,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:54,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:54,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:54,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:54,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:54,760 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:54,826 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:12:54,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:54,826 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:54,827 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:54,827 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:54,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:54,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 119. [2019-08-05 11:12:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:54,831 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:54,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:54,831 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:54,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:54,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:54,831 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:54,831 INFO L418 AbstractCegarLoop]: === Iteration 911 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:54,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:54,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1465572140, now seen corresponding path program 892 times [2019-08-05 11:12:54,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:54,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:54,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:54,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:54,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:54,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:54,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:54,961 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:55,023 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2019-08-05 11:12:55,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:55,024 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:55,025 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:12:55,025 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:12:55,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:12:55,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 127. [2019-08-05 11:12:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:55,028 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:55,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:55,029 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:55,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:55,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:55,029 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:55,029 INFO L418 AbstractCegarLoop]: === Iteration 912 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:55,030 INFO L82 PathProgramCache]: Analyzing trace with hash 893410198, now seen corresponding path program 893 times [2019-08-05 11:12:55,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:55,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:55,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:55,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:55,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:55,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:55,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:55,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:55,157 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:55,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:55,221 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2019-08-05 11:12:55,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:55,221 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:55,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:55,222 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:12:55,222 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:12:55,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:12:55,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 123. [2019-08-05 11:12:55,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:55,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:55,226 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:55,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:55,226 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:55,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:55,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:55,227 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:55,227 INFO L418 AbstractCegarLoop]: === Iteration 913 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:55,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1419199916, now seen corresponding path program 894 times [2019-08-05 11:12:55,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:55,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:55,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:55,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:55,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:55,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:55,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:55,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:55,455 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:55,570 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:12:55,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:55,570 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:55,571 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:55,571 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:55,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:55,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 115. [2019-08-05 11:12:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:55,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:55,575 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:55,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:55,575 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:55,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:55,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:55,576 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:55,576 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:55,576 INFO L418 AbstractCegarLoop]: === Iteration 914 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:55,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:55,576 INFO L82 PathProgramCache]: Analyzing trace with hash 622987926, now seen corresponding path program 895 times [2019-08-05 11:12:55,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:55,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:55,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:55,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:55,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:55,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:55,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:55,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:55,898 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:55,976 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:55,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:55,977 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:55,978 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:55,978 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:55,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 123. [2019-08-05 11:12:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:55,981 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:55,981 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:55,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:55,982 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:55,982 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:55,982 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:55,982 INFO L418 AbstractCegarLoop]: === Iteration 915 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:55,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:55,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1735994412, now seen corresponding path program 896 times [2019-08-05 11:12:55,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:55,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:55,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:56,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:56,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:56,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:56,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:56,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:56,115 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:56,182 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:12:56,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:56,182 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:56,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:56,183 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:56,183 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:56,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:56,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:56,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 119. [2019-08-05 11:12:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:56,187 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:56,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:56,187 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:56,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:56,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:56,188 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:56,188 INFO L418 AbstractCegarLoop]: === Iteration 916 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:56,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:56,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1205132522, now seen corresponding path program 897 times [2019-08-05 11:12:56,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:56,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:56,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:56,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:56,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:56,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:56,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:56,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:56,318 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:56,384 INFO L93 Difference]: Finished difference Result 209 states and 258 transitions. [2019-08-05 11:12:56,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:56,384 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:56,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:56,385 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:56,385 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:56,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 123. [2019-08-05 11:12:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:56,389 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:56,389 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:56,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:56,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:56,390 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:56,390 INFO L418 AbstractCegarLoop]: === Iteration 917 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:56,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:56,390 INFO L82 PathProgramCache]: Analyzing trace with hash 362548308, now seen corresponding path program 898 times [2019-08-05 11:12:56,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:56,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:56,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:56,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:56,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:56,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:56,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:56,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:56,519 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:56,611 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2019-08-05 11:12:56,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:56,612 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:56,613 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:12:56,613 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:12:56,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:12:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 127. [2019-08-05 11:12:56,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:56,616 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:56,617 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:56,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:56,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:56,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:56,617 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:56,617 INFO L418 AbstractCegarLoop]: === Iteration 918 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:56,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:56,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1153849816, now seen corresponding path program 899 times [2019-08-05 11:12:56,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:56,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:56,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:56,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:56,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:56,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:56,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:56,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:56,769 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:56,838 INFO L93 Difference]: Finished difference Result 201 states and 248 transitions. [2019-08-05 11:12:56,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:56,838 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:56,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:56,839 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:56,839 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:12:56,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:12:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 107. [2019-08-05 11:12:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:12:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:12:56,843 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:12:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:56,843 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:12:56,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:12:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:56,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:56,844 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:56,844 INFO L418 AbstractCegarLoop]: === Iteration 919 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:56,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:56,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1996434030, now seen corresponding path program 900 times [2019-08-05 11:12:56,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:56,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:56,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:56,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:56,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:56,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:56,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:56,979 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:12:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:57,047 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2019-08-05 11:12:57,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:57,047 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:57,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:57,048 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:12:57,048 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:12:57,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:57,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:12:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 95. [2019-08-05 11:12:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:12:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-08-05 11:12:57,051 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 68 [2019-08-05 11:12:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:57,051 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-08-05 11:12:57,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-08-05 11:12:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:57,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:57,052 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:57,052 INFO L418 AbstractCegarLoop]: === Iteration 920 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:57,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2101746922, now seen corresponding path program 901 times [2019-08-05 11:12:57,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:57,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:57,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:12:57,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:57,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:57,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:57,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:57,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:57,180 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 21 states. [2019-08-05 11:12:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:57,242 INFO L93 Difference]: Finished difference Result 179 states and 221 transitions. [2019-08-05 11:12:57,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:57,243 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:57,244 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:12:57,244 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:12:57,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:57,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:12:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 107. [2019-08-05 11:12:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:12:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:12:57,247 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:12:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:57,247 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:12:57,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:12:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:57,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:57,248 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:57,248 INFO L418 AbstractCegarLoop]: === Iteration 921 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash -165761964, now seen corresponding path program 902 times [2019-08-05 11:12:57,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:57,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:57,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:57,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:57,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:57,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:57,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:57,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:57,377 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:12:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:57,445 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2019-08-05 11:12:57,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:57,445 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:57,446 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:12:57,446 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:12:57,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:57,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:12:57,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 103. [2019-08-05 11:12:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:12:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:12:57,449 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:12:57,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:57,450 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:12:57,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:12:57,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:57,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:57,450 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:57,450 INFO L418 AbstractCegarLoop]: === Iteration 922 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:57,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:57,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1759855792, now seen corresponding path program 903 times [2019-08-05 11:12:57,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:57,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:57,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:12:57,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:57,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:57,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:57,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:57,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:57,625 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:12:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:57,686 INFO L93 Difference]: Finished difference Result 189 states and 233 transitions. [2019-08-05 11:12:57,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:57,687 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:57,688 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:12:57,688 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:12:57,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:57,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:12:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 123. [2019-08-05 11:12:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:57,691 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:57,691 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:57,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:57,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:57,692 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:57,692 INFO L418 AbstractCegarLoop]: === Iteration 923 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:57,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:57,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1932780756, now seen corresponding path program 904 times [2019-08-05 11:12:57,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:57,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:57,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:57,817 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:57,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:57,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:57,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:57,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:57,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:57,818 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:57,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:57,888 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2019-08-05 11:12:57,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:57,888 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:57,889 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:12:57,889 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:12:57,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:57,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:12:57,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 127. [2019-08-05 11:12:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:57,892 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:57,893 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:57,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:57,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:57,893 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:57,893 INFO L418 AbstractCegarLoop]: === Iteration 924 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:57,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:57,893 INFO L82 PathProgramCache]: Analyzing trace with hash 599126546, now seen corresponding path program 905 times [2019-08-05 11:12:57,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:57,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:57,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:58,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:58,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:58,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:58,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:58,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:58,021 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:58,089 INFO L93 Difference]: Finished difference Result 209 states and 258 transitions. [2019-08-05 11:12:58,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:58,090 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:58,091 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:12:58,091 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:12:58,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:58,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:12:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 123. [2019-08-05 11:12:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:58,094 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:58,094 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:58,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:58,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:58,095 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:58,095 INFO L418 AbstractCegarLoop]: === Iteration 925 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:58,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:58,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1499416174, now seen corresponding path program 906 times [2019-08-05 11:12:58,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:58,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:58,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:58,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:58,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:58,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:58,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:58,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:58,225 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:58,295 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2019-08-05 11:12:58,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:58,295 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:58,296 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:12:58,296 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:12:58,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:12:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 127. [2019-08-05 11:12:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:58,300 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:58,300 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:58,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:58,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:58,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:58,301 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:58,301 INFO L418 AbstractCegarLoop]: === Iteration 926 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:58,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:58,301 INFO L82 PathProgramCache]: Analyzing trace with hash -426201582, now seen corresponding path program 907 times [2019-08-05 11:12:58,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:58,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:58,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:58,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:58,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:58,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:58,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:58,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:58,430 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:58,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:58,490 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2019-08-05 11:12:58,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:58,490 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:58,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:58,491 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:12:58,491 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:12:58,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:12:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 119. [2019-08-05 11:12:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:58,494 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:58,495 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:58,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:58,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:58,495 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:58,495 INFO L418 AbstractCegarLoop]: === Iteration 927 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:58,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:58,496 INFO L82 PathProgramCache]: Analyzing trace with hash 859566164, now seen corresponding path program 908 times [2019-08-05 11:12:58,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:58,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:58,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:58,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:58,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:58,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:58,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:58,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:58,625 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:58,686 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:12:58,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:58,687 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:58,688 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:12:58,688 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:12:58,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:12:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 111. [2019-08-05 11:12:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:12:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:12:58,691 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:12:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:58,691 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:12:58,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:12:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:58,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:58,692 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:58,692 INFO L418 AbstractCegarLoop]: === Iteration 928 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:58,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1615986260, now seen corresponding path program 909 times [2019-08-05 11:12:58,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:58,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:58,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:58,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:58,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:58,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:58,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:58,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:58,822 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:12:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:58,884 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2019-08-05 11:12:58,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:58,885 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:58,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:58,885 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:12:58,886 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:12:58,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:12:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 119. [2019-08-05 11:12:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:12:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:12:58,890 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:12:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:58,890 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:12:58,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:12:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:58,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:58,890 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:58,891 INFO L418 AbstractCegarLoop]: === Iteration 929 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:58,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:58,891 INFO L82 PathProgramCache]: Analyzing trace with hash -742996078, now seen corresponding path program 910 times [2019-08-05 11:12:58,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:58,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:58,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:59,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:59,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:59,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:59,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:59,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:59,026 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:12:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:59,099 INFO L93 Difference]: Finished difference Result 187 states and 231 transitions. [2019-08-05 11:12:59,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:59,099 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:59,100 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:12:59,100 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:12:59,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:12:59,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 115. [2019-08-05 11:12:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:12:59,103 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:12:59,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:59,104 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:12:59,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:12:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:59,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:59,104 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:59,104 INFO L418 AbstractCegarLoop]: === Iteration 930 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:59,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1182621678, now seen corresponding path program 911 times [2019-08-05 11:12:59,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:59,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:59,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:59,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:59,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:59,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:59,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:59,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:59,241 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:12:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:59,304 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2019-08-05 11:12:59,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:59,305 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:59,306 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:12:59,306 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:12:59,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:12:59,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 123. [2019-08-05 11:12:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:59,310 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:59,310 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:59,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:59,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:59,310 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:59,311 INFO L418 AbstractCegarLoop]: === Iteration 931 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:59,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:59,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1355546642, now seen corresponding path program 912 times [2019-08-05 11:12:59,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:59,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:59,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:12:59,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:59,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:59,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:59,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:59,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:59,443 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:59,514 INFO L93 Difference]: Finished difference Result 177 states and 218 transitions. [2019-08-05 11:12:59,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:59,515 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:59,516 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:12:59,516 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:12:59,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:59,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:12:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 127. [2019-08-05 11:12:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-08-05 11:12:59,519 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 68 [2019-08-05 11:12:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:59,519 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-08-05 11:12:59,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-08-05 11:12:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:59,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:59,520 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:59,520 INFO L418 AbstractCegarLoop]: === Iteration 932 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:59,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:59,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1176360660, now seen corresponding path program 913 times [2019-08-05 11:12:59,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:59,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:59,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:12:59,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:59,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:59,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:59,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:59,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:59,676 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 21 states. [2019-08-05 11:12:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:59,741 INFO L93 Difference]: Finished difference Result 223 states and 276 transitions. [2019-08-05 11:12:59,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:59,742 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:59,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:59,743 INFO L225 Difference]: With dead ends: 223 [2019-08-05 11:12:59,743 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 11:12:59,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:59,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 11:12:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 123. [2019-08-05 11:12:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:12:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:12:59,746 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:12:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:59,747 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:12:59,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:12:59,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:59,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:59,747 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:59,747 INFO L418 AbstractCegarLoop]: === Iteration 933 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:59,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:59,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1003435696, now seen corresponding path program 914 times [2019-08-05 11:12:59,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:59,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:59,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:12:59,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:59,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:59,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:59,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:59,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:59,878 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:12:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:59,938 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2019-08-05 11:12:59,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:59,938 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:12:59,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:59,939 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:12:59,939 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:12:59,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:12:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 95. [2019-08-05 11:12:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:12:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-08-05 11:12:59,942 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 68 [2019-08-05 11:12:59,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:59,942 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-08-05 11:12:59,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-08-05 11:12:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:59,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:59,943 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:59,943 INFO L418 AbstractCegarLoop]: === Iteration 934 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1109505244, now seen corresponding path program 915 times [2019-08-05 11:12:59,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:59,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:59,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:13:00,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:00,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:00,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:00,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:00,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:00,074 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 21 states. [2019-08-05 11:13:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:00,135 INFO L93 Difference]: Finished difference Result 173 states and 213 transitions. [2019-08-05 11:13:00,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:00,136 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:00,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:00,137 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:13:00,137 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:13:00,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:13:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 119. [2019-08-05 11:13:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:00,140 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:00,141 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:00,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:00,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:00,141 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:00,141 INFO L418 AbstractCegarLoop]: === Iteration 935 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:00,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:00,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1249477094, now seen corresponding path program 916 times [2019-08-05 11:13:00,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:00,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:00,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:00,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:00,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:00,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:00,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:00,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:00,266 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:00,330 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2019-08-05 11:13:00,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:00,330 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:00,331 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:13:00,331 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:13:00,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:13:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 115. [2019-08-05 11:13:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:00,335 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:00,335 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:00,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:00,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:00,336 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:00,336 INFO L418 AbstractCegarLoop]: === Iteration 936 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash -922182060, now seen corresponding path program 917 times [2019-08-05 11:13:00,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:00,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:00,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:00,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:00,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:00,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:00,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:00,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:00,466 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:00,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:00,572 INFO L93 Difference]: Finished difference Result 223 states and 276 transitions. [2019-08-05 11:13:00,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:00,572 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:00,573 INFO L225 Difference]: With dead ends: 223 [2019-08-05 11:13:00,573 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 11:13:00,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:00,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 11:13:00,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 119. [2019-08-05 11:13:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:00,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:00,576 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:00,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:00,576 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:00,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:00,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:00,577 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:00,577 INFO L418 AbstractCegarLoop]: === Iteration 937 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:00,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:00,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1436800278, now seen corresponding path program 918 times [2019-08-05 11:13:00,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:00,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:00,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:00,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:00,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:00,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:00,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:00,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:00,980 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:01,043 INFO L93 Difference]: Finished difference Result 223 states and 276 transitions. [2019-08-05 11:13:01,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:01,043 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:01,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:01,044 INFO L225 Difference]: With dead ends: 223 [2019-08-05 11:13:01,044 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 11:13:01,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 11:13:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 107. [2019-08-05 11:13:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:13:01,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:13:01,047 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:13:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:01,048 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:13:01,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:13:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:01,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:01,048 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:01,048 INFO L418 AbstractCegarLoop]: === Iteration 938 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:01,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 849065626, now seen corresponding path program 919 times [2019-08-05 11:13:01,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:01,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:01,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:01,186 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:01,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:01,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:01,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:01,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:01,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:01,187 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:13:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:01,362 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2019-08-05 11:13:01,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:01,363 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:01,364 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:13:01,364 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:13:01,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:13:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 111. [2019-08-05 11:13:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:13:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:13:01,367 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:13:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:01,368 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:13:01,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:13:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:01,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:01,368 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:01,368 INFO L418 AbstractCegarLoop]: === Iteration 939 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1509916712, now seen corresponding path program 920 times [2019-08-05 11:13:01,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:01,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:01,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:01,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:01,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:01,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:01,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:01,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:01,570 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:13:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:01,643 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2019-08-05 11:13:01,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:01,643 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:01,644 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:13:01,644 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:13:01,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:13:01,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 103. [2019-08-05 11:13:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:13:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:13:01,647 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:13:01,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:01,648 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:13:01,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:13:01,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:01,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:01,648 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:01,648 INFO L418 AbstractCegarLoop]: === Iteration 940 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:01,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1542113170, now seen corresponding path program 921 times [2019-08-05 11:13:01,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:01,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:01,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:13:01,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:01,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:01,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:01,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:01,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:01,778 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:13:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:01,845 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:13:01,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:01,845 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:01,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:01,846 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:13:01,846 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:13:01,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:13:01,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 115. [2019-08-05 11:13:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:01,849 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:01,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:01,850 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:01,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:01,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:01,850 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:01,850 INFO L418 AbstractCegarLoop]: === Iteration 941 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:01,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:01,850 INFO L82 PathProgramCache]: Analyzing trace with hash 532271130, now seen corresponding path program 922 times [2019-08-05 11:13:01,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:01,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:01,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:01,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:01,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:01,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:01,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:01,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:01,981 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:02,041 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2019-08-05 11:13:02,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:02,041 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:02,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:02,042 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:13:02,042 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:13:02,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:13:02,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 123. [2019-08-05 11:13:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:02,046 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:02,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:02,046 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:02,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:02,047 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:02,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:02,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:02,047 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:02,047 INFO L418 AbstractCegarLoop]: === Iteration 942 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:02,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:02,047 INFO L82 PathProgramCache]: Analyzing trace with hash -393871788, now seen corresponding path program 923 times [2019-08-05 11:13:02,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:02,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:02,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:02,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:02,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:02,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:02,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:02,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:02,236 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:02,307 INFO L93 Difference]: Finished difference Result 223 states and 276 transitions. [2019-08-05 11:13:02,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:02,307 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:02,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:02,308 INFO L225 Difference]: With dead ends: 223 [2019-08-05 11:13:02,308 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 11:13:02,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:02,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 11:13:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 119. [2019-08-05 11:13:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:02,312 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:02,312 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:02,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:02,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:02,312 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:02,312 INFO L418 AbstractCegarLoop]: === Iteration 943 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:02,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1826711208, now seen corresponding path program 924 times [2019-08-05 11:13:02,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:02,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:02,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:02,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:02,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:02,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:02,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:02,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:02,443 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:02,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:02,509 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2019-08-05 11:13:02,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:02,510 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:02,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:02,511 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:13:02,511 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:13:02,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:13:02,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 115. [2019-08-05 11:13:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:02,514 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:02,515 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:02,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:02,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:02,515 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:02,515 INFO L418 AbstractCegarLoop]: === Iteration 944 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:02,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:02,515 INFO L82 PathProgramCache]: Analyzing trace with hash 271831512, now seen corresponding path program 925 times [2019-08-05 11:13:02,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:02,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:02,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:02,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:02,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:02,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:02,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:02,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:02,645 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:02,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:02,718 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2019-08-05 11:13:02,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:02,719 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:02,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:02,720 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:13:02,720 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:13:02,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:02,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:13:02,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 119. [2019-08-05 11:13:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:02,724 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:02,724 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:02,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:02,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:02,724 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:02,724 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:02,724 INFO L418 AbstractCegarLoop]: === Iteration 945 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1802552788, now seen corresponding path program 926 times [2019-08-05 11:13:02,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:02,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:02,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:02,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:02,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:02,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:02,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:02,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:02,856 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:02,926 INFO L93 Difference]: Finished difference Result 221 states and 274 transitions. [2019-08-05 11:13:02,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:02,926 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:02,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:02,927 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:13:02,927 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:13:02,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:13:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 123. [2019-08-05 11:13:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:02,931 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:02,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:02,931 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:02,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:02,931 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:02,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:02,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:02,932 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:02,932 INFO L418 AbstractCegarLoop]: === Iteration 946 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:02,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:02,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2087150826, now seen corresponding path program 927 times [2019-08-05 11:13:02,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:02,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:02,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:03,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:03,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:03,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:03,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:03,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:03,082 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:03,143 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2019-08-05 11:13:03,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:03,143 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:03,144 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:13:03,144 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:13:03,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:13:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 111. [2019-08-05 11:13:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:13:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:13:03,148 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:13:03,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:03,148 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:13:03,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:13:03,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:03,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:03,149 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:03,149 INFO L418 AbstractCegarLoop]: === Iteration 947 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:03,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:03,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2102503578, now seen corresponding path program 928 times [2019-08-05 11:13:03,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:03,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:03,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:03,276 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:03,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:03,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:03,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:03,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:03,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:03,277 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:13:03,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:03,340 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2019-08-05 11:13:03,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:03,340 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:03,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:03,341 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:13:03,341 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:13:03,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:13:03,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 123. [2019-08-05 11:13:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:03,345 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:03,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:03,346 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:03,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:03,346 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:03,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:03,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:03,346 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:03,346 INFO L418 AbstractCegarLoop]: === Iteration 948 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:03,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:03,346 INFO L82 PathProgramCache]: Analyzing trace with hash -256478760, now seen corresponding path program 929 times [2019-08-05 11:13:03,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:03,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:03,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:03,477 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:03,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:03,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:03,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:03,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:03,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:03,478 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:03,547 INFO L93 Difference]: Finished difference Result 223 states and 276 transitions. [2019-08-05 11:13:03,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:03,548 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:03,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:03,549 INFO L225 Difference]: With dead ends: 223 [2019-08-05 11:13:03,549 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 11:13:03,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:03,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 11:13:03,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 119. [2019-08-05 11:13:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:03,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:03,553 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:03,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:03,553 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:03,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:03,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:03,553 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:03,553 INFO L418 AbstractCegarLoop]: === Iteration 949 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:03,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:03,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1842063960, now seen corresponding path program 930 times [2019-08-05 11:13:03,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:03,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:03,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:03,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:03,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:03,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:03,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:03,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:03,685 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:03,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:03,752 INFO L93 Difference]: Finished difference Result 221 states and 274 transitions. [2019-08-05 11:13:03,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:03,753 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:03,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:03,753 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:13:03,754 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:13:03,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:03,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:13:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 123. [2019-08-05 11:13:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:03,757 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:03,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:03,757 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:03,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:03,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:03,758 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:03,758 INFO L418 AbstractCegarLoop]: === Iteration 950 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:03,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:03,758 INFO L82 PathProgramCache]: Analyzing trace with hash -133432170, now seen corresponding path program 931 times [2019-08-05 11:13:03,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:03,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:03,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:03,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:03,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:03,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:03,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:03,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:03,881 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:03,940 INFO L93 Difference]: Finished difference Result 221 states and 274 transitions. [2019-08-05 11:13:03,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:03,941 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:03,942 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:13:03,942 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:13:03,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:13:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 115. [2019-08-05 11:13:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:03,945 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:03,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:03,945 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:03,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:03,945 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:03,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:03,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:03,946 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:03,946 INFO L418 AbstractCegarLoop]: === Iteration 951 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:03,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:03,946 INFO L82 PathProgramCache]: Analyzing trace with hash -516918378, now seen corresponding path program 932 times [2019-08-05 11:13:03,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:03,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:03,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:04,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:04,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:04,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:04,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:04,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:04,073 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:04,137 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:13:04,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:04,137 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:04,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:04,138 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:04,138 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:04,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 107. [2019-08-05 11:13:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:13:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:13:04,142 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:13:04,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:04,142 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:13:04,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:04,142 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:13:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:04,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:04,143 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:04,143 INFO L418 AbstractCegarLoop]: === Iteration 952 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:04,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:04,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1525269464, now seen corresponding path program 933 times [2019-08-05 11:13:04,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:04,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:04,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:04,264 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:04,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:04,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:04,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:04,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:04,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:04,265 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:13:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:04,327 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:13:04,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:04,328 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:04,329 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:04,329 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:04,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:04,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 115. [2019-08-05 11:13:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:04,332 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:04,332 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:04,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:04,333 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:04,333 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:04,333 INFO L418 AbstractCegarLoop]: === Iteration 953 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash -833712874, now seen corresponding path program 934 times [2019-08-05 11:13:04,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:04,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:04,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:04,462 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:04,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:04,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:04,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:04,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:04,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:04,463 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:04,532 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:13:04,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:04,532 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:04,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:04,533 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:04,533 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:04,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:04,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 111. [2019-08-05 11:13:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:13:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:13:04,537 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:13:04,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:04,537 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:13:04,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:04,537 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:13:04,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:04,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:04,538 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:04,538 INFO L418 AbstractCegarLoop]: === Iteration 954 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:04,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:04,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1264829846, now seen corresponding path program 935 times [2019-08-05 11:13:04,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:04,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:04,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:04,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:04,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:04,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:04,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:04,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:04,672 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:13:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:04,739 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2019-08-05 11:13:04,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:04,740 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:04,741 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:13:04,741 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:13:04,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:04,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:13:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 115. [2019-08-05 11:13:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:04,745 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:04,745 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:04,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:04,745 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:04,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:04,745 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:04,745 INFO L418 AbstractCegarLoop]: === Iteration 955 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1094152492, now seen corresponding path program 936 times [2019-08-05 11:13:04,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:04,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:04,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:04,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:04,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:04,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:04,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:04,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:04,884 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:04,945 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:13:04,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:04,946 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:04,946 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:13:04,947 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:13:04,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:04,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:13:04,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 99. [2019-08-05 11:13:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:13:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:13:04,950 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:13:04,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:04,950 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:13:04,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:04,950 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:13:04,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:04,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:04,950 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:04,951 INFO L418 AbstractCegarLoop]: === Iteration 956 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:04,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:04,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2041634278, now seen corresponding path program 937 times [2019-08-05 11:13:04,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:04,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:04,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:05,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:05,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:05,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:05,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:05,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:05,080 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:13:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:05,149 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2019-08-05 11:13:05,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:05,149 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:05,150 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:13:05,150 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:13:05,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:13:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 115. [2019-08-05 11:13:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:05,153 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:05,154 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:05,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:05,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:05,154 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:05,154 INFO L418 AbstractCegarLoop]: === Iteration 957 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:05,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:05,154 INFO L82 PathProgramCache]: Analyzing trace with hash -105649320, now seen corresponding path program 938 times [2019-08-05 11:13:05,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:05,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:05,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:05,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:05,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:05,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:05,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:05,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:05,285 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:05,350 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:13:05,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:05,351 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:05,351 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:13:05,352 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:13:05,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:13:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 111. [2019-08-05 11:13:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:13:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:13:05,355 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:13:05,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:05,356 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:13:05,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:13:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:05,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:05,356 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:05,356 INFO L418 AbstractCegarLoop]: === Iteration 958 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:05,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:05,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1992893400, now seen corresponding path program 939 times [2019-08-05 11:13:05,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:05,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:05,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:05,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:05,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:05,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:05,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:05,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:05,528 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:13:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:05,595 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:13:05,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:05,596 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:05,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:05,596 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:05,597 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:05,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:05,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 115. [2019-08-05 11:13:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:05,600 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:05,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:05,600 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:05,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:05,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:05,601 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:05,601 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:05,601 INFO L418 AbstractCegarLoop]: === Iteration 959 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:05,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:05,601 INFO L82 PathProgramCache]: Analyzing trace with hash -366088938, now seen corresponding path program 940 times [2019-08-05 11:13:05,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:05,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:05,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:06,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:06,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:06,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:06,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:06,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:06,086 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:06,157 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:13:06,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:06,158 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:06,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:06,158 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:06,159 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:06,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:06,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 107. [2019-08-05 11:13:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:13:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:13:06,162 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:13:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:06,163 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:13:06,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:13:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:06,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:06,163 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:06,163 INFO L418 AbstractCegarLoop]: === Iteration 960 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:06,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:06,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1676098904, now seen corresponding path program 941 times [2019-08-05 11:13:06,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:06,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:06,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:06,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:06,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:06,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:06,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:06,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:06,310 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:13:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:06,383 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:13:06,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:06,383 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:06,384 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:06,384 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:06,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:06,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-08-05 11:13:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:06,388 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:06,388 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:06,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:06,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:06,389 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:06,389 INFO L418 AbstractCegarLoop]: === Iteration 961 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:06,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:06,389 INFO L82 PathProgramCache]: Analyzing trace with hash -682883434, now seen corresponding path program 942 times [2019-08-05 11:13:06,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:06,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:06,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:06,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:06,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:06,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:06,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:06,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:06,515 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:06,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:06,589 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:13:06,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:06,589 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:06,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:06,590 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:06,590 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:06,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:06,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 111. [2019-08-05 11:13:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:13:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:13:06,594 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:13:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:06,594 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:13:06,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:13:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:06,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:06,594 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:06,594 INFO L418 AbstractCegarLoop]: === Iteration 962 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:06,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1415659286, now seen corresponding path program 943 times [2019-08-05 11:13:06,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:06,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:06,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:06,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:06,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:06,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:06,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:06,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:06,733 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:13:06,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:06,801 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:13:06,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:06,801 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:06,802 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:06,802 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:06,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-08-05 11:13:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:06,806 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:06,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:06,806 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:06,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:06,806 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:06,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:06,806 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:06,807 INFO L418 AbstractCegarLoop]: === Iteration 963 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:06,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:06,807 INFO L82 PathProgramCache]: Analyzing trace with hash -943323052, now seen corresponding path program 944 times [2019-08-05 11:13:06,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:06,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:06,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:06,926 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:06,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:06,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:06,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:06,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:06,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:06,927 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:06,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:06,993 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:13:06,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:06,993 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:06,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:06,994 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:06,994 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:06,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:06,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:06,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 103. [2019-08-05 11:13:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:13:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:13:06,998 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:13:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:06,998 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:13:06,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:13:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:06,998 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:06,998 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:06,999 INFO L418 AbstractCegarLoop]: === Iteration 964 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:06,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1048635944, now seen corresponding path program 945 times [2019-08-05 11:13:06,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:07,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:07,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:07,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:07,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:07,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:07,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:07,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:07,132 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:13:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:07,197 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:13:07,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:07,198 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:07,199 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:07,199 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:07,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:07,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-08-05 11:13:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:07,202 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:07,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:07,202 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:07,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:07,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:07,203 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:07,203 INFO L418 AbstractCegarLoop]: === Iteration 965 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:07,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:07,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2119347284, now seen corresponding path program 946 times [2019-08-05 11:13:07,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:07,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:07,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:07,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:07,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:07,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:07,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:07,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:07,340 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:07,404 INFO L93 Difference]: Finished difference Result 221 states and 274 transitions. [2019-08-05 11:13:07,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:07,404 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:07,405 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:13:07,405 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:13:07,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:13:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 123. [2019-08-05 11:13:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:07,409 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:07,409 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:07,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:07,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:07,409 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:07,410 INFO L418 AbstractCegarLoop]: === Iteration 966 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:07,410 INFO L82 PathProgramCache]: Analyzing trace with hash 183362326, now seen corresponding path program 947 times [2019-08-05 11:13:07,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:07,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:07,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:07,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:07,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:07,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:07,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:07,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:07,533 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:07,591 INFO L93 Difference]: Finished difference Result 221 states and 274 transitions. [2019-08-05 11:13:07,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:07,592 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:07,593 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:13:07,593 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:13:07,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:13:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 119. [2019-08-05 11:13:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:07,596 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:07,596 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:07,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:07,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:07,597 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:07,597 INFO L418 AbstractCegarLoop]: === Iteration 967 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:07,597 INFO L82 PathProgramCache]: Analyzing trace with hash 887349014, now seen corresponding path program 948 times [2019-08-05 11:13:07,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:07,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:07,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:07,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:07,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:07,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:07,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:07,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:07,762 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:07,833 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:13:07,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:07,833 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:07,834 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:07,834 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:07,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:07,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:07,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 115. [2019-08-05 11:13:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:07,838 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:07,838 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:07,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:07,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:07,839 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:07,839 INFO L418 AbstractCegarLoop]: === Iteration 968 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:07,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:07,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1309075562, now seen corresponding path program 949 times [2019-08-05 11:13:07,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:07,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:07,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:07,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:07,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:07,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:07,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:07,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:07,963 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:08,033 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:13:08,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:08,033 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:08,034 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:08,034 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:08,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 119. [2019-08-05 11:13:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:08,038 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:08,038 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:08,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:08,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:08,039 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:08,039 INFO L418 AbstractCegarLoop]: === Iteration 969 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:08,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1915180394, now seen corresponding path program 950 times [2019-08-05 11:13:08,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:08,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:08,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:08,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:08,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:08,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:08,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:08,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:08,168 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:08,241 INFO L93 Difference]: Finished difference Result 223 states and 276 transitions. [2019-08-05 11:13:08,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:08,241 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:08,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:08,242 INFO L225 Difference]: With dead ends: 223 [2019-08-05 11:13:08,242 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 11:13:08,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 11:13:08,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 123. [2019-08-05 11:13:08,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:08,246 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:08,246 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:08,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:08,247 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:08,247 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:08,247 INFO L418 AbstractCegarLoop]: === Iteration 970 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:08,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:08,247 INFO L82 PathProgramCache]: Analyzing trace with hash 626909396, now seen corresponding path program 951 times [2019-08-05 11:13:08,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:08,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:08,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:08,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:08,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:08,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:08,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:08,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:08,379 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:08,449 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:13:08,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:08,449 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:08,450 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:13:08,450 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:13:08,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:13:08,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 115. [2019-08-05 11:13:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:08,454 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:08,454 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:08,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:08,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:08,455 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:08,455 INFO L418 AbstractCegarLoop]: === Iteration 971 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:08,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:08,455 INFO L82 PathProgramCache]: Analyzing trace with hash 443801944, now seen corresponding path program 952 times [2019-08-05 11:13:08,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:08,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:08,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:08,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:08,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:08,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:08,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:08,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:08,580 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:08,648 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:13:08,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:08,648 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:08,649 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:13:08,649 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:13:08,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:13:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 99. [2019-08-05 11:13:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:13:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:13:08,653 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:13:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:08,653 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:13:08,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:13:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:08,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:08,654 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:08,654 INFO L418 AbstractCegarLoop]: === Iteration 972 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:08,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1625870058, now seen corresponding path program 953 times [2019-08-05 11:13:08,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:08,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:08,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:08,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:08,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:08,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:08,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:08,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:08,782 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:13:08,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:08,855 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:13:08,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:08,855 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:08,856 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:13:08,856 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:13:08,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:13:08,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 107. [2019-08-05 11:13:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:13:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:13:08,860 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:13:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:08,860 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:13:08,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:13:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:08,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:08,861 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:08,861 INFO L418 AbstractCegarLoop]: === Iteration 973 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:08,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash 310114900, now seen corresponding path program 954 times [2019-08-05 11:13:08,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:08,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:08,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:09,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:09,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:09,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:09,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:09,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:09,022 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:13:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:09,083 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:13:09,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:09,084 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:09,085 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:13:09,085 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:13:09,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:09,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:13:09,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 103. [2019-08-05 11:13:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:13:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:13:09,088 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:13:09,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:09,088 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:13:09,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:13:09,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:09,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:09,089 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:09,089 INFO L418 AbstractCegarLoop]: === Iteration 974 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:09,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:09,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1886309676, now seen corresponding path program 955 times [2019-08-05 11:13:09,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:09,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:09,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:09,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:09,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:09,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:09,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:09,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:09,232 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:13:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:09,296 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2019-08-05 11:13:09,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:09,297 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:09,298 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:13:09,298 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:13:09,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:13:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 107. [2019-08-05 11:13:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:13:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:13:09,301 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:13:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:09,301 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:13:09,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:13:09,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:09,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:09,302 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:09,302 INFO L418 AbstractCegarLoop]: === Iteration 975 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:09,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:09,302 INFO L82 PathProgramCache]: Analyzing trace with hash 49675282, now seen corresponding path program 956 times [2019-08-05 11:13:09,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:09,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:09,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:13:09,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:09,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:09,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:09,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:09,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:09,426 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:13:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:09,486 INFO L93 Difference]: Finished difference Result 195 states and 241 transitions. [2019-08-05 11:13:09,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:09,486 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:09,487 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:13:09,487 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:13:09,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:13:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 87. [2019-08-05 11:13:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:13:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2019-08-05 11:13:09,490 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 68 [2019-08-05 11:13:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:09,491 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2019-08-05 11:13:09,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2019-08-05 11:13:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:09,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:09,491 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:09,491 INFO L418 AbstractCegarLoop]: === Iteration 976 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:09,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:09,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1331586406, now seen corresponding path program 957 times [2019-08-05 11:13:09,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:09,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:09,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:09,622 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:09,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:09,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:09,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:09,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:09,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:09,623 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand 21 states. [2019-08-05 11:13:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:09,682 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2019-08-05 11:13:09,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:09,683 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:09,683 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:13:09,684 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:13:09,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:13:09,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 107. [2019-08-05 11:13:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:13:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:13:09,687 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:13:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:09,687 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:13:09,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:09,688 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:13:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:09,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:09,688 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:09,688 INFO L418 AbstractCegarLoop]: === Iteration 977 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:09,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:09,688 INFO L82 PathProgramCache]: Analyzing trace with hash 604398552, now seen corresponding path program 958 times [2019-08-05 11:13:09,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:09,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:09,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:09,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:09,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:09,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:09,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:09,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:09,819 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:13:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:09,888 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2019-08-05 11:13:09,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:09,889 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:09,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:09,890 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:13:09,890 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:13:09,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:09,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:13:09,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 103. [2019-08-05 11:13:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:13:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:13:09,893 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:13:09,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:09,893 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:13:09,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:13:09,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:09,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:09,894 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:09,894 INFO L418 AbstractCegarLoop]: === Iteration 978 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:09,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:09,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1592026024, now seen corresponding path program 959 times [2019-08-05 11:13:09,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:09,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:09,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:10,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:10,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:10,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:10,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:10,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:10,019 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:13:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:10,082 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:13:10,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:10,082 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:10,083 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:13:10,083 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:13:10,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:13:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 107. [2019-08-05 11:13:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:13:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:13:10,087 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:13:10,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:10,087 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:13:10,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:13:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:10,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:10,087 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:10,087 INFO L418 AbstractCegarLoop]: === Iteration 979 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:10,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:10,088 INFO L82 PathProgramCache]: Analyzing trace with hash 343958934, now seen corresponding path program 960 times [2019-08-05 11:13:10,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:10,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:10,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:10,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:10,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:10,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:10,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:10,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:10,235 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:13:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:10,307 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-08-05 11:13:10,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:10,307 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:10,308 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:13:10,308 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:13:10,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:13:10,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 99. [2019-08-05 11:13:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:13:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:13:10,311 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:13:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:10,311 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:13:10,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:13:10,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:10,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:10,312 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:10,312 INFO L418 AbstractCegarLoop]: === Iteration 980 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:10,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:10,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1908820520, now seen corresponding path program 961 times [2019-08-05 11:13:10,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:10,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:10,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:10,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:10,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:10,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:10,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:10,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:10,439 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:13:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:10,511 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:13:10,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:10,512 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:10,513 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:13:10,513 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:13:10,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:13:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 107. [2019-08-05 11:13:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:13:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:13:10,516 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:13:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:10,516 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:13:10,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:13:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:10,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:10,517 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:10,517 INFO L418 AbstractCegarLoop]: === Iteration 981 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash 27164438, now seen corresponding path program 962 times [2019-08-05 11:13:10,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:10,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:10,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:10,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:10,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:10,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:10,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:10,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:10,644 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:13:10,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:10,719 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-08-05 11:13:10,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:10,719 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:10,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:10,720 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:13:10,720 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:13:10,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:13:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 103. [2019-08-05 11:13:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:13:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:13:10,724 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:13:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:10,724 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:13:10,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:13:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:10,724 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:10,725 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:10,725 INFO L418 AbstractCegarLoop]: === Iteration 982 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:10,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:10,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1391283730, now seen corresponding path program 963 times [2019-08-05 11:13:10,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:10,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:10,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:13:11,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:11,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:11,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:11,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:11,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:11,200 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:13:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:11,265 INFO L93 Difference]: Finished difference Result 195 states and 241 transitions. [2019-08-05 11:13:11,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:11,266 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:11,267 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:13:11,267 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:13:11,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:13:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 119. [2019-08-05 11:13:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:11,270 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:11,271 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:11,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:11,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:11,271 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:11,271 INFO L418 AbstractCegarLoop]: === Iteration 983 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:11,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:11,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2125707158, now seen corresponding path program 964 times [2019-08-05 11:13:11,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:11,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:11,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:11,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:11,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:11,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:11,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:11,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:11,560 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:11,624 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:13:11,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:11,625 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:11,626 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:11,626 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:11,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 123. [2019-08-05 11:13:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:11,629 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:11,629 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:11,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:11,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:11,629 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:11,630 INFO L418 AbstractCegarLoop]: === Iteration 984 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:11,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:11,630 INFO L82 PathProgramCache]: Analyzing trace with hash -233275180, now seen corresponding path program 965 times [2019-08-05 11:13:11,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:11,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:11,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:11,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:11,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:11,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:11,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:11,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:11,755 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:11,823 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:13:11,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:11,824 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:11,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:11,824 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:11,825 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:11,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 111. [2019-08-05 11:13:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:13:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:13:11,829 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:13:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:11,829 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:13:11,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:11,829 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:13:11,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:11,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:11,829 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:11,829 INFO L418 AbstractCegarLoop]: === Iteration 985 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:11,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:11,830 INFO L82 PathProgramCache]: Analyzing trace with hash -544701228, now seen corresponding path program 966 times [2019-08-05 11:13:11,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:11,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:11,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:11,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:11,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:11,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:11,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:11,966 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:13:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:12,042 INFO L93 Difference]: Finished difference Result 195 states and 241 transitions. [2019-08-05 11:13:12,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:12,043 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:12,043 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:13:12,044 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:13:12,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:12,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:13:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 107. [2019-08-05 11:13:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:13:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:13:12,047 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:13:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:12,047 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:13:12,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:12,047 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:13:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:12,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:12,048 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:12,048 INFO L418 AbstractCegarLoop]: === Iteration 986 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:12,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:12,048 INFO L82 PathProgramCache]: Analyzing trace with hash -338588072, now seen corresponding path program 967 times [2019-08-05 11:13:12,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:12,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:12,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:12,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:12,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:12,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:12,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:12,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:12,204 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:13:12,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:12,269 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:13:12,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:12,269 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:12,270 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:12,270 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:12,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:12,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 119. [2019-08-05 11:13:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:12,274 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:12,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:12,274 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:12,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:12,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:12,275 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:12,275 INFO L418 AbstractCegarLoop]: === Iteration 987 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:12,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:12,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1597396886, now seen corresponding path program 968 times [2019-08-05 11:13:12,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:12,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:12,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:12,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:12,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:12,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:12,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:12,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:12,402 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:12,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:12,468 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:13:12,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:12,468 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:12,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:12,469 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:12,469 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:12,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:12,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:12,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-08-05 11:13:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:12,472 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:12,473 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:12,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:12,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:12,473 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:12,473 INFO L418 AbstractCegarLoop]: === Iteration 988 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:12,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:12,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1651723348, now seen corresponding path program 969 times [2019-08-05 11:13:12,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:12,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:12,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:12,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:12,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:12,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:12,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:12,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:12,604 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:12,691 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-08-05 11:13:12,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:12,691 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:12,692 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:13:12,692 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:13:12,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:13:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 119. [2019-08-05 11:13:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:12,695 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:12,696 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:12,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:12,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:12,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:12,696 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:12,696 INFO L418 AbstractCegarLoop]: === Iteration 989 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:12,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:12,696 INFO L82 PathProgramCache]: Analyzing trace with hash -599027690, now seen corresponding path program 970 times [2019-08-05 11:13:12,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:12,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:12,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:12,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:12,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:12,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:12,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:12,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:12,871 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:12,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:12,944 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:13:12,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:12,944 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:12,945 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:12,945 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:12,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 123. [2019-08-05 11:13:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:12,948 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:12,948 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:12,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:12,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:12,949 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:12,949 INFO L418 AbstractCegarLoop]: === Iteration 990 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:12,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:12,949 INFO L82 PathProgramCache]: Analyzing trace with hash -284261610, now seen corresponding path program 971 times [2019-08-05 11:13:12,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:12,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:12,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:13,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:13,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:13,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:13,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:13,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:13,072 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:13,144 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-08-05 11:13:13,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:13,144 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:13,145 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:13,145 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:13:13,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:13:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 115. [2019-08-05 11:13:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:13,149 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:13,149 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:13,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:13,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:13,149 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:13,150 INFO L418 AbstractCegarLoop]: === Iteration 991 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:13,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:13,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1968517844, now seen corresponding path program 972 times [2019-08-05 11:13:13,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:13,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:13,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:13,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:13,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:13,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:13,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:13,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:13,268 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:13,334 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:13:13,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:13,335 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:13,336 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:13,336 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:13,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:13,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:13,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 123. [2019-08-05 11:13:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:13,339 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:13,339 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:13,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:13,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:13,340 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:13,340 INFO L418 AbstractCegarLoop]: === Iteration 992 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:13,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:13,340 INFO L82 PathProgramCache]: Analyzing trace with hash 32532886, now seen corresponding path program 973 times [2019-08-05 11:13:13,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:13,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:13,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:13,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:13,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:13,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:13,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:13,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:13,469 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:13,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:13,536 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:13:13,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:13,537 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:13,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:13,538 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:13,538 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:13,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:13,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 119. [2019-08-05 11:13:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:13,541 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:13,542 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:13,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:13,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:13,542 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:13,542 INFO L418 AbstractCegarLoop]: === Iteration 993 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:13,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:13,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2066009834, now seen corresponding path program 974 times [2019-08-05 11:13:13,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:13,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:13,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:13,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:13,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:13,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:13,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:13,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:13,670 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:13,742 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2019-08-05 11:13:13,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:13,743 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:13,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:13,744 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:13:13,744 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:13:13,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:13:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 123. [2019-08-05 11:13:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:13,747 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:13,747 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:13,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:13,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:13,748 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:13,748 INFO L418 AbstractCegarLoop]: === Iteration 994 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:13,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:13,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1336957268, now seen corresponding path program 975 times [2019-08-05 11:13:13,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:13,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:13,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:13,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:13,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:13,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:13,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:13,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:13,877 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:13,938 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:13:13,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:13,938 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:13,939 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:13,939 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:13,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 115. [2019-08-05 11:13:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:13,942 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:13,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:13,943 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:13,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:13,943 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:13,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:13,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:13,943 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:13,943 INFO L418 AbstractCegarLoop]: === Iteration 995 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:13,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:13,943 INFO L82 PathProgramCache]: Analyzing trace with hash -915822186, now seen corresponding path program 976 times [2019-08-05 11:13:13,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:13,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:13,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:14,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:14,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:14,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:14,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:14,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:14,066 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:14,132 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:13:14,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:14,133 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:14,133 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:13:14,134 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:13:14,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:13:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 123. [2019-08-05 11:13:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:14,137 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:14,137 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:14,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:14,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:14,138 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:14,138 INFO L418 AbstractCegarLoop]: === Iteration 996 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:14,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:14,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1020162772, now seen corresponding path program 977 times [2019-08-05 11:13:14,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:14,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:14,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:14,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:14,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:14,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:14,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:14,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:14,328 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:14,395 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:13:14,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:14,395 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:14,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:14,396 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:13:14,396 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:13:14,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:13:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 119. [2019-08-05 11:13:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:14,399 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:14,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:14,399 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:14,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:14,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:14,400 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:14,400 INFO L418 AbstractCegarLoop]: === Iteration 997 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:14,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:14,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1176261804, now seen corresponding path program 978 times [2019-08-05 11:13:14,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:14,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:14,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:14,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:14,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:14,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:14,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:14,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:14,529 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:14,597 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2019-08-05 11:13:14,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:14,598 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:14,598 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:13:14,599 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:13:14,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:13:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 123. [2019-08-05 11:13:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:14,602 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:14,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:14,602 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:14,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:14,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:14,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:14,603 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:14,603 INFO L418 AbstractCegarLoop]: === Iteration 998 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:14,603 INFO L82 PathProgramCache]: Analyzing trace with hash 759723154, now seen corresponding path program 979 times [2019-08-05 11:13:14,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:14,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:14,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:13:14,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:14,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:14,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:14,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:14,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:14,732 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:14,803 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2019-08-05 11:13:14,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:14,803 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:14,804 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:13:14,804 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:13:14,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:13:14,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 107. [2019-08-05 11:13:14,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:13:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:13:14,807 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:13:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:14,807 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:13:14,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:13:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:14,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:14,808 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:14,808 INFO L418 AbstractCegarLoop]: === Iteration 999 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:14,808 INFO L82 PathProgramCache]: Analyzing trace with hash -187758632, now seen corresponding path program 980 times [2019-08-05 11:13:14,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:14,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:14,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:14,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:14,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:14,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:14,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:14,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:14,952 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:13:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:15,044 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2019-08-05 11:13:15,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:15,044 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:15,045 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:13:15,045 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:13:15,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:13:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 123. [2019-08-05 11:13:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:15,048 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:15,049 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:15,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:15,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:15,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:15,049 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:15,049 INFO L418 AbstractCegarLoop]: === Iteration 1000 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:15,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:15,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1748226326, now seen corresponding path program 981 times [2019-08-05 11:13:15,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:15,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:15,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:15,183 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:15,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:15,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:15,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:15,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:15,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:15,184 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:15,250 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:13:15,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:15,251 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:15,252 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:13:15,252 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:13:15,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:15,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:13:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 119. [2019-08-05 11:13:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:15,255 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:15,256 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:15,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:15,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:15,256 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:15,256 INFO L418 AbstractCegarLoop]: === Iteration 1001 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash -448198250, now seen corresponding path program 982 times [2019-08-05 11:13:15,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:15,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:15,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:15,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:15,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:15,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:15,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:15,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:15,383 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:15,451 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:13:15,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:15,452 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:15,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:15,453 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:15,453 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:15,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:15,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 123. [2019-08-05 11:13:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:15,456 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:15,457 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:15,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:15,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:15,457 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:15,457 INFO L418 AbstractCegarLoop]: === Iteration 1002 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:15,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:15,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1487786708, now seen corresponding path program 983 times [2019-08-05 11:13:15,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:15,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:15,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:15,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:15,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:15,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:15,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:15,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:15,590 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:15,655 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-08-05 11:13:15,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:15,656 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:15,657 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:15,657 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:15,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 115. [2019-08-05 11:13:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:15,661 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:15,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:15,661 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:15,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:15,661 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:15,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:15,662 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:15,662 INFO L418 AbstractCegarLoop]: === Iteration 1003 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:15,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:15,662 INFO L82 PathProgramCache]: Analyzing trace with hash -764992746, now seen corresponding path program 984 times [2019-08-05 11:13:15,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:15,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:15,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:15,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:15,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:15,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:15,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:15,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:15,825 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:15,921 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:13:15,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:15,922 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:15,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:15,923 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:13:15,923 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:13:15,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:13:15,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 123. [2019-08-05 11:13:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:15,927 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:15,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:15,927 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:15,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:15,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:15,927 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:15,928 INFO L418 AbstractCegarLoop]: === Iteration 1004 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:15,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1170992212, now seen corresponding path program 985 times [2019-08-05 11:13:15,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:15,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:15,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:16,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:16,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:16,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:16,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:16,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:16,286 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:16,353 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-08-05 11:13:16,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:16,354 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:16,355 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:13:16,355 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:13:16,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:13:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 119. [2019-08-05 11:13:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:16,358 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:16,358 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:16,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:16,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:16,359 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:16,359 INFO L418 AbstractCegarLoop]: === Iteration 1005 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:16,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:16,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1025432364, now seen corresponding path program 986 times [2019-08-05 11:13:16,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:16,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:16,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:16,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:16,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:16,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:16,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:16,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:16,491 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:16,559 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2019-08-05 11:13:16,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:16,559 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:16,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:16,560 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:13:16,560 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:13:16,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:13:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 123. [2019-08-05 11:13:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:16,564 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:16,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:16,564 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:16,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:16,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:16,564 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:16,564 INFO L418 AbstractCegarLoop]: === Iteration 1006 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:16,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:16,565 INFO L82 PathProgramCache]: Analyzing trace with hash 910552594, now seen corresponding path program 987 times [2019-08-05 11:13:16,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:16,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:16,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:13:16,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:16,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:16,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:16,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:16,696 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:16,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:16,763 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2019-08-05 11:13:16,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:16,763 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:16,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:16,764 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:13:16,764 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:13:16,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:13:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 111. [2019-08-05 11:13:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:13:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:13:16,769 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:13:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:16,769 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:13:16,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:13:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:16,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:16,769 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:16,770 INFO L418 AbstractCegarLoop]: === Iteration 1007 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:16,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash 805239702, now seen corresponding path program 988 times [2019-08-05 11:13:16,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:16,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:16,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:16,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:16,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:16,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:16,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:16,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:16,903 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:13:16,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:16,970 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2019-08-05 11:13:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:16,971 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:16,972 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:13:16,972 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:13:16,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:13:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2019-08-05 11:13:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:16,975 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:16,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:16,975 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:16,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:16,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:16,975 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:16,975 INFO L418 AbstractCegarLoop]: === Iteration 1008 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1553742636, now seen corresponding path program 989 times [2019-08-05 11:13:16,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:16,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:16,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:17,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:17,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:17,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:17,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:17,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:17,103 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:17,173 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-08-05 11:13:17,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:17,174 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:17,175 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:13:17,175 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:13:17,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:13:17,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 119. [2019-08-05 11:13:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:17,178 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:17,178 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:17,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:17,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:17,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:17,179 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:17,179 INFO L418 AbstractCegarLoop]: === Iteration 1009 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:17,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:17,179 INFO L82 PathProgramCache]: Analyzing trace with hash 544800084, now seen corresponding path program 990 times [2019-08-05 11:13:17,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:17,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:17,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:17,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:17,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:17,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:17,309 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:17,381 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2019-08-05 11:13:17,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:17,381 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:17,382 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:13:17,382 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:13:17,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:13:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 123. [2019-08-05 11:13:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:17,386 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:17,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:17,386 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:17,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:17,387 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:17,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:17,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:17,387 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:17,387 INFO L418 AbstractCegarLoop]: === Iteration 1010 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:17,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:17,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1814182254, now seen corresponding path program 991 times [2019-08-05 11:13:17,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:17,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:17,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:13:17,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:17,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:17,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:17,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:17,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:17,519 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:17,595 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2019-08-05 11:13:17,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:17,595 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:17,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:17,596 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:13:17,596 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:13:17,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:13:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 115. [2019-08-05 11:13:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:13:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-08-05 11:13:17,600 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 68 [2019-08-05 11:13:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:17,601 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-08-05 11:13:17,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-08-05 11:13:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:17,601 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:17,601 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:17,601 INFO L418 AbstractCegarLoop]: === Iteration 1011 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:17,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:17,601 INFO L82 PathProgramCache]: Analyzing trace with hash 228005588, now seen corresponding path program 992 times [2019-08-05 11:13:17,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:17,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:17,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:17,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:17,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:17,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:17,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:17,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:17,731 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 21 states. [2019-08-05 11:13:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:17,800 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2019-08-05 11:13:17,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:17,801 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:17,801 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:13:17,801 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:13:17,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:17,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:13:17,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 123. [2019-08-05 11:13:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:17,805 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:17,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:17,806 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:17,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:17,806 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:17,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:17,806 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:17,806 INFO L418 AbstractCegarLoop]: === Iteration 1012 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:17,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:17,807 INFO L82 PathProgramCache]: Analyzing trace with hash -2130976750, now seen corresponding path program 993 times [2019-08-05 11:13:17,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:17,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:17,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:13:17,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:17,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:17,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:17,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:17,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:17,942 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:18,017 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2019-08-05 11:13:18,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:18,018 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:18,019 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:13:18,019 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:13:18,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:13:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 119. [2019-08-05 11:13:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:13:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2019-08-05 11:13:18,022 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 68 [2019-08-05 11:13:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:18,022 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2019-08-05 11:13:18,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2019-08-05 11:13:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:18,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:18,023 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:18,023 INFO L418 AbstractCegarLoop]: === Iteration 1013 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:18,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:18,023 INFO L82 PathProgramCache]: Analyzing trace with hash -32434030, now seen corresponding path program 994 times [2019-08-05 11:13:18,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:18,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:18,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:13:18,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:18,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:18,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:18,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:18,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:18,153 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand 21 states. [2019-08-05 11:13:18,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:18,223 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2019-08-05 11:13:18,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:18,224 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:18,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:18,224 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:13:18,224 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:13:18,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:13:18,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 123. [2019-08-05 11:13:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:13:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2019-08-05 11:13:18,228 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 68 [2019-08-05 11:13:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:18,228 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2019-08-05 11:13:18,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2019-08-05 11:13:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:18,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:18,229 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:13:18,229 INFO L418 AbstractCegarLoop]: === Iteration 1014 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:18,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:18,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1903550928, now seen corresponding path program 995 times [2019-08-05 11:13:18,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:18,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:18,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:13:18,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:18,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:18,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:18,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:18,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:18,366 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 21 states. [2019-08-05 11:13:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:18,432 INFO L93 Difference]: Finished difference Result 177 states and 218 transitions. [2019-08-05 11:13:18,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:18,433 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:18,434 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:13:18,434 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:13:18,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:18,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:13:18,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 99. [2019-08-05 11:13:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:13:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:13:18,437 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:13:18,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:18,437 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:13:18,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:13:18,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:18,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:18,438 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:18,438 INFO L418 AbstractCegarLoop]: === Iteration 1015 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:18,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:18,438 INFO L82 PathProgramCache]: Analyzing trace with hash -700025830, now seen corresponding path program 996 times [2019-08-05 11:13:18,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:18,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:18,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:18,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:18,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:18,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:18,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:18,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:18,563 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:13:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:18,626 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2019-08-05 11:13:18,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:18,627 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:18,628 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:13:18,628 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:13:18,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:13:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 111. [2019-08-05 11:13:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:13:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:13:18,631 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:13:18,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:18,631 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:13:18,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:13:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:18,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:18,632 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:18,632 INFO L418 AbstractCegarLoop]: === Iteration 1016 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:18,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:18,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1235959128, now seen corresponding path program 997 times [2019-08-05 11:13:18,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:18,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:18,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:18,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:18,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:18,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:18,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:18,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:18,760 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:13:18,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:18,826 INFO L93 Difference]: Finished difference Result 197 states and 243 transitions. [2019-08-05 11:13:18,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:18,827 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:18,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:18,827 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:13:18,828 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:13:18,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:13:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 107. [2019-08-05 11:13:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:13:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:13:18,831 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:13:18,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:18,831 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:13:18,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:13:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:18,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:18,832 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:18,832 INFO L418 AbstractCegarLoop]: === Iteration 1017 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:18,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash -960465448, now seen corresponding path program 998 times [2019-08-05 11:13:18,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:18,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:18,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:18,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:18,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:18,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:18,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:18,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:18,964 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:13:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,033 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2019-08-05 11:13:19,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:19,034 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,035 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:13:19,035 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:13:19,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:13:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 111. [2019-08-05 11:13:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:13:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:13:19,039 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:13:19,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,039 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:13:19,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:13:19,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:19,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:19,040 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:19,040 INFO L418 AbstractCegarLoop]: === Iteration 1018 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:19,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:19,040 INFO L82 PathProgramCache]: Analyzing trace with hash 975519510, now seen corresponding path program 999 times [2019-08-05 11:13:19,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:19,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:19,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:19,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:19,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:19,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:19,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:19,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:19,194 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:13:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,264 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2019-08-05 11:13:19,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:19,265 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,266 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:13:19,266 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:13:19,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:19,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:13:19,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 103. [2019-08-05 11:13:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:13:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-08-05 11:13:19,269 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 68 [2019-08-05 11:13:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,269 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-08-05 11:13:19,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-08-05 11:13:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:19,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:19,270 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:19,270 INFO L418 AbstractCegarLoop]: === Iteration 1019 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:19,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:19,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1277259944, now seen corresponding path program 1000 times [2019-08-05 11:13:19,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:19,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:19,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:19,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:19,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:19,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:19,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:19,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:19,401 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 21 states. [2019-08-05 11:13:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,459 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2019-08-05 11:13:19,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:19,459 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,460 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:13:19,460 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:13:19,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:13:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 111. [2019-08-05 11:13:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:13:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:13:19,464 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:13:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,464 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:13:19,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:13:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:19,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:19,465 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:19,465 INFO L418 AbstractCegarLoop]: === Iteration 1020 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:19,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:19,465 INFO L82 PathProgramCache]: Analyzing trace with hash 658725014, now seen corresponding path program 1001 times [2019-08-05 11:13:19,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:19,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:19,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:19,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:19,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:19,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:19,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:19,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:19,594 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:13:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,663 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2019-08-05 11:13:19,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:19,664 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,664 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:13:19,665 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:13:19,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:19,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:13:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 107. [2019-08-05 11:13:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:13:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-08-05 11:13:19,668 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 68 [2019-08-05 11:13:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,668 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-08-05 11:13:19,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-08-05 11:13:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:19,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:19,669 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:19,669 INFO L418 AbstractCegarLoop]: === Iteration 1021 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:19,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:19,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1537699562, now seen corresponding path program 1002 times [2019-08-05 11:13:19,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:19,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:19,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:19,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:19,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:19,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:19,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:19,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:19,799 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 21 states. [2019-08-05 11:13:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,862 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2019-08-05 11:13:19,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:19,862 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,863 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:13:19,863 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:13:19,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:19,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:13:19,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 111. [2019-08-05 11:13:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:13:19,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-08-05 11:13:19,866 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 68 [2019-08-05 11:13:19,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,867 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-08-05 11:13:19,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-08-05 11:13:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:19,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:19,867 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:19,867 INFO L418 AbstractCegarLoop]: === Iteration 1022 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:19,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:19,867 INFO L82 PathProgramCache]: Analyzing trace with hash 398285396, now seen corresponding path program 1003 times [2019-08-05 11:13:19,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:19,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:19,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:19,996 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 11:13:19,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:19,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:19,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:19,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:19,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:19,997 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 21 states. [2019-08-05 11:13:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:20,058 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2019-08-05 11:13:20,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:20,058 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:20,059 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:13:20,059 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:13:20,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:13:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 99. [2019-08-05 11:13:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:13:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2019-08-05 11:13:20,062 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 68 [2019-08-05 11:13:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:20,062 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2019-08-05 11:13:20,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2019-08-05 11:13:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:13:20,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:20,063 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:20,063 INFO L418 AbstractCegarLoop]: === Iteration 1023 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:20,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:20,063 INFO L82 PathProgramCache]: Analyzing trace with hash 292972504, now seen corresponding path program 1004 times [2019-08-05 11:13:20,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:20,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:20,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:13:20,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:20,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:20,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:20,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:20,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:20,200 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand 21 states. [2019-08-05 11:13:20,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:20,262 INFO L93 Difference]: Finished difference Result 179 states and 221 transitions. [2019-08-05 11:13:20,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:20,263 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-08-05 11:13:20,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:20,263 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:13:20,264 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:13:20,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:20,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:13:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 69. [2019-08-05 11:13:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:13:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2019-08-05 11:13:20,267 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 68 [2019-08-05 11:13:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:20,267 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-08-05 11:13:20,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2019-08-05 11:13:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:13:20,268 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:20,268 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2019-08-05 11:13:20,268 INFO L418 AbstractCegarLoop]: === Iteration 1024 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:20,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:20,268 INFO L82 PathProgramCache]: Analyzing trace with hash -478246412, now seen corresponding path program 10 times [2019-08-05 11:13:20,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:20,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:13:20,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:13:20,448 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:13:20,449 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:13:20,453 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:13:20,453 INFO L202 PluginConnector]: Adding new model recursive-CallABAB_simple_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:13:20 BoogieIcfgContainer [2019-08-05 11:13:20,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:13:20,456 INFO L168 Benchmark]: Toolchain (without parser) took 233046.71 ms. Allocated memory was 139.5 MB in the beginning and 934.3 MB in the end (delta: 794.8 MB). Free memory was 109.2 MB in the beginning and 499.1 MB in the end (delta: -389.9 MB). Peak memory consumption was 404.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:20,456 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 139.5 MB. Free memory is still 110.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:13:20,457 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.48 ms. Allocated memory is still 139.5 MB. Free memory was 109.2 MB in the beginning and 107.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:20,457 INFO L168 Benchmark]: Boogie Preprocessor took 22.35 ms. Allocated memory is still 139.5 MB. Free memory was 107.5 MB in the beginning and 106.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:20,457 INFO L168 Benchmark]: RCFGBuilder took 306.87 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 96.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:20,458 INFO L168 Benchmark]: TraceAbstraction took 232670.26 ms. Allocated memory was 139.5 MB in the beginning and 934.3 MB in the end (delta: 794.8 MB). Free memory was 95.6 MB in the beginning and 499.1 MB in the end (delta: -403.5 MB). Peak memory consumption was 391.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:20,460 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.25 ms. Allocated memory is still 139.5 MB. Free memory is still 110.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.48 ms. Allocated memory is still 139.5 MB. Free memory was 109.2 MB in the beginning and 107.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.35 ms. Allocated memory is still 139.5 MB. Free memory was 107.5 MB in the beginning and 106.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 306.87 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 96.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 232670.26 ms. Allocated memory was 139.5 MB in the beginning and 934.3 MB in the end (delta: 794.8 MB). Free memory was 95.6 MB in the beginning and 499.1 MB in the end (delta: -403.5 MB). Peak memory consumption was 391.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14). Cancelled while BasicCegarLoop was analyzing trace of length 76 with TraceHistMax 11,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 14 locations, 1 error locations. TIMEOUT Result, 232.6s OverallTime, 1024 OverallIterations, 11 TraceHistogramMax, 70.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12297 SDtfs, 0 SDslu, 79659 SDs, 0 SdLazy, 57596 SolverSat, 11947 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61450 GetRequests, 44039 SyntacticMatches, 0 SemanticMatches, 17411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61894 ImplicationChecksByTransitivity, 145.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=777, 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: 3.1s AutomataMinimizationTime, 1023 MinimizatonAttempts, 68174 StatesRemovedByMinimization, 1021 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 152.8s InterpolantComputationTime, 62473 NumberOfCodeBlocks, 62473 NumberOfCodeBlocksAsserted, 1023 NumberOfCheckSat, 61450 ConstructedInterpolants, 0 QuantifiedInterpolants, 8078930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 136209 ConjunctsInSsa, 18434 ConjunctsInUnsatCore, 1023 InterpolantComputations, 1 PerfectInterpolantSequences, 82424/187888 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown