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/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:04:21,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:04:21,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:04:21,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:04:21,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:04:21,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:04:21,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:04:21,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:04:21,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:04:21,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:04:21,429 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:04:21,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:04:21,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:04:21,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:04:21,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:04:21,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:04:21,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:04:21,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:04:21,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:04:21,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:04:21,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:04:21,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:04:21,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:04:21,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:04:21,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:04:21,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:04:21,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:04:21,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:04:21,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:04:21,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:04:21,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:04:21,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:04:21,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:04:21,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:04:21,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:04:21,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:04:21,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:04:21,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:04:21,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:04:21,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:04:21,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:04:21,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:04:21,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:04:21,496 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:04:21,497 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:04:21,498 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:04:21,499 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_11.bpl [2019-08-05 11:04:21,499 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_11.bpl' [2019-08-05 11:04:21,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:04:21,543 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:04:21,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:04:21,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:04:21,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:04:21,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:21" (1/1) ... [2019-08-05 11:04:21,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:21" (1/1) ... [2019-08-05 11:04:21,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:04:21,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:04:21,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:04:21,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:04:21,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:21" (1/1) ... [2019-08-05 11:04:21,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:21" (1/1) ... [2019-08-05 11:04:21,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:21" (1/1) ... [2019-08-05 11:04:21,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:21" (1/1) ... [2019-08-05 11:04:21,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:21" (1/1) ... [2019-08-05 11:04:21,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:21" (1/1) ... [2019-08-05 11:04:21,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:21" (1/1) ... [2019-08-05 11:04:21,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:04:21,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:04:21,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:04:21,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:04:21,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:21" (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:04:21,681 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:04:21,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:04:22,057 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:04:22,057 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:04:22,058 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:04:22 BoogieIcfgContainer [2019-08-05 11:04:22,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:04:22,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:04:22,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:04:22,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:04:22,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:21" (1/2) ... [2019-08-05 11:04:22,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f16653 and model type ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:04:22, skipping insertion in model container [2019-08-05 11:04:22,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:04:22" (2/2) ... [2019-08-05 11:04:22,069 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c_11.bpl [2019-08-05 11:04:22,078 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:04:22,084 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:04:22,098 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:04:22,120 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:04:22,121 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:04:22,121 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:04:22,121 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:04:22,121 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:04:22,121 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:04:22,122 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:04:22,122 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:04:22,122 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:04:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 11:04:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:04:22,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:22,145 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:04:22,147 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:22,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash 28697802, now seen corresponding path program 1 times [2019-08-05 11:04:22,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:22,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:04:22,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:22,381 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:04:22,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:04:22,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:04:22,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:04:22,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:04:22,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:04:22,406 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-08-05 11:04:22,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:22,523 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 11:04:22,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:04:22,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:04:22,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:22,538 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:04:22,538 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:04:22,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:04:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:04:22,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 11:04:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:04:22,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 11:04:22,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-08-05 11:04:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:22,578 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 11:04:22,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:04:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 11:04:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:04:22,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:22,580 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 11:04:22,580 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:22,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1806601935, now seen corresponding path program 1 times [2019-08-05 11:04:22,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:22,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:04:22,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:22,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:22,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:04:22,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:04:22,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:04:22,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:04:22,895 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-08-05 11:04:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:23,049 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-08-05 11:04:23,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:04:23,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:04:23,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:23,063 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:04:23,063 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:04:23,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:04:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:04:23,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 11:04:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:04:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-08-05 11:04:23,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2019-08-05 11:04:23,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:23,068 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-08-05 11:04:23,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:04:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-08-05 11:04:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:04:23,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:23,070 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:04:23,071 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:23,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:23,071 INFO L82 PathProgramCache]: Analyzing trace with hash 977724265, now seen corresponding path program 1 times [2019-08-05 11:04:23,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:23,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:04:23,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:23,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:23,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:04:23,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:04:23,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:04:23,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:04:23,274 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 6 states. [2019-08-05 11:04:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:23,715 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-08-05 11:04:23,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:04:23,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 11:04:23,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:23,717 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:04:23,717 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:04:23,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:04:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:04:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-08-05 11:04:23,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:04:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-08-05 11:04:23,721 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2019-08-05 11:04:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:23,722 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-08-05 11:04:23,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:04:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2019-08-05 11:04:23,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:04:23,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:23,723 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2019-08-05 11:04:23,723 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:23,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:23,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1143014126, now seen corresponding path program 2 times [2019-08-05 11:04:23,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:23,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:04:23,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:04:23,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:23,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:04:23,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:04:23,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:04:23,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:04:23,879 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 5 states. [2019-08-05 11:04:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:24,103 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 11:04:24,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:04:24,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-08-05 11:04:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:24,104 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:04:24,104 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:04:24,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:04:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:04:24,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:04:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:04:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 11:04:24,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2019-08-05 11:04:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:24,109 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 11:04:24,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:04:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 11:04:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:04:24,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:24,110 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1] [2019-08-05 11:04:24,110 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:24,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1360430456, now seen corresponding path program 3 times [2019-08-05 11:04:24,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:24,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:04:24,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:04:24,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:24,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:04:24,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:04:24,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:04:24,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:04:24,383 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2019-08-05 11:04:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:24,601 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-08-05 11:04:24,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:04:24,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 11:04:24,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:24,604 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:04:24,604 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:04:24,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:04:24,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:04:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-05 11:04:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:04:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-08-05 11:04:24,608 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2019-08-05 11:04:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:24,608 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-08-05 11:04:24,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:04:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-08-05 11:04:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:04:24,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:24,609 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1] [2019-08-05 11:04:24,609 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:24,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1703557918, now seen corresponding path program 4 times [2019-08-05 11:04:24,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:24,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:04:24,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:04:24,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:24,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:04:24,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:04:24,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:04:24,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:04:24,903 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2019-08-05 11:04:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:25,365 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-08-05 11:04:25,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:04:25,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-05 11:04:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:25,367 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:04:25,367 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:04:25,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:04:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:04:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-08-05 11:04:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:04:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-08-05 11:04:25,373 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 15 [2019-08-05 11:04:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:25,373 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-08-05 11:04:25,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:04:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-08-05 11:04:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:04:25,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:25,374 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 3, 1, 1, 1] [2019-08-05 11:04:25,375 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:25,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:25,375 INFO L82 PathProgramCache]: Analyzing trace with hash -83236965, now seen corresponding path program 5 times [2019-08-05 11:04:25,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:25,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:04:25,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 11:04:25,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:25,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:04:25,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:04:25,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:04:25,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:04:25,623 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 9 states. [2019-08-05 11:04:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:25,988 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-08-05 11:04:25,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:04:25,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-08-05 11:04:25,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:25,990 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:04:25,991 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:04:25,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:04:25,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:04:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-08-05 11:04:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:04:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-08-05 11:04:25,996 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 21 [2019-08-05 11:04:25,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:25,996 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-08-05 11:04:25,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:04:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-08-05 11:04:25,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:04:25,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:25,997 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 3, 1, 1, 1] [2019-08-05 11:04:25,997 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:25,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:25,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1613707573, now seen corresponding path program 6 times [2019-08-05 11:04:25,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:26,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:04:26,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 52 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 11:04:26,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:26,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:04:26,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:04:26,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:04:26,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:04:26,191 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 10 states. [2019-08-05 11:04:26,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:26,467 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2019-08-05 11:04:26,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:04:26,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-08-05 11:04:26,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:26,469 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:04:26,469 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:04:26,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:26,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:04:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-08-05 11:04:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:04:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-08-05 11:04:26,476 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2019-08-05 11:04:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:26,476 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-08-05 11:04:26,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:04:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-08-05 11:04:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:04:26,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:26,477 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 4, 1, 1, 1] [2019-08-05 11:04:26,477 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:26,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:26,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1586458132, now seen corresponding path program 7 times [2019-08-05 11:04:26,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:26,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:04:26,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 59 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-08-05 11:04:26,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:26,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:04:26,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:04:26,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:04:26,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:04:26,625 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 7 states. [2019-08-05 11:04:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:26,753 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-08-05 11:04:26,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:04:26,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-08-05 11:04:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:26,757 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:04:26,757 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:04:26,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:04:26,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:04:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:04:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:04:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-08-05 11:04:26,762 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 27 [2019-08-05 11:04:26,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:26,763 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-08-05 11:04:26,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:04:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-08-05 11:04:26,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:04:26,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:26,764 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 4, 1, 1, 1] [2019-08-05 11:04:26,764 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:26,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:26,765 INFO L82 PathProgramCache]: Analyzing trace with hash 687182574, now seen corresponding path program 8 times [2019-08-05 11:04:26,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:26,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:04:26,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 78 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-08-05 11:04:27,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:27,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:04:27,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:04:27,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:04:27,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:04:27,401 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 9 states. [2019-08-05 11:04:27,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:27,640 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-08-05 11:04:27,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:04:27,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-05 11:04:27,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:27,641 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:04:27,641 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:04:27,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:04:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:04:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:04:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:04:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-08-05 11:04:27,645 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2019-08-05 11:04:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:27,645 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-08-05 11:04:27,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:04:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-08-05 11:04:27,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:04:27,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:27,647 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 4, 1, 1, 1] [2019-08-05 11:04:27,647 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:27,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:27,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1902422664, now seen corresponding path program 9 times [2019-08-05 11:04:27,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:27,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:04:27,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 52 proven. 80 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-08-05 11:04:27,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:27,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:04:27,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:04:27,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:04:27,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:04:27,947 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 11 states. [2019-08-05 11:04:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:29,010 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-08-05 11:04:29,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:04:29,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-08-05 11:04:29,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:29,012 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:04:29,012 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:04:29,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:04:29,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-08-05 11:04:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:04:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-08-05 11:04:29,018 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2019-08-05 11:04:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:29,019 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-08-05 11:04:29,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:04:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-08-05 11:04:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:04:29,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:29,020 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 4, 1, 1, 1] [2019-08-05 11:04:29,020 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:29,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:29,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1427835678, now seen corresponding path program 10 times [2019-08-05 11:04:29,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:29,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:04:29,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 130 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-08-05 11:04:29,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:29,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:04:29,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:04:29,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:04:29,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:04:29,254 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 12 states. [2019-08-05 11:04:29,732 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 11:04:30,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:30,083 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-08-05 11:04:30,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:04:30,083 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-08-05 11:04:30,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:30,084 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:04:30,084 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:04:30,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:04:30,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:04:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-08-05 11:04:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:04:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-08-05 11:04:30,090 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 33 [2019-08-05 11:04:30,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:30,090 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-08-05 11:04:30,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:04:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-08-05 11:04:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:04:30,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:30,092 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 6, 5, 1, 1, 1] [2019-08-05 11:04:30,092 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:30,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1226368395, now seen corresponding path program 11 times [2019-08-05 11:04:30,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:30,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:04:30,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 172 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-05 11:04:31,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:31,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:04:31,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:04:31,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:04:31,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:04:31,107 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 11 states. [2019-08-05 11:04:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:31,372 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-08-05 11:04:31,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:04:31,373 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-08-05 11:04:31,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:31,374 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:04:31,374 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:04:31,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:04:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:04:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:04:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-08-05 11:04:31,379 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 41 [2019-08-05 11:04:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:31,379 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-08-05 11:04:31,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:04:31,380 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-08-05 11:04:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:04:31,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:31,381 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 6, 5, 1, 1, 1] [2019-08-05 11:04:31,381 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:31,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:31,381 INFO L82 PathProgramCache]: Analyzing trace with hash -2072396721, now seen corresponding path program 12 times [2019-08-05 11:04:31,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:31,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:04:31,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 127 proven. 153 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-08-05 11:04:31,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:31,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:04:31,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:04:31,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:04:31,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:04:31,668 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 13 states. [2019-08-05 11:04:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:32,048 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-08-05 11:04:32,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:04:32,058 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2019-08-05 11:04:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:32,059 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:04:32,060 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:04:32,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:04:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-08-05 11:04:32,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:04:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-08-05 11:04:32,064 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2019-08-05 11:04:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:32,064 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-08-05 11:04:32,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:04:32,065 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-08-05 11:04:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:04:32,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:32,066 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 6, 5, 1, 1, 1] [2019-08-05 11:04:32,066 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:32,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1291628777, now seen corresponding path program 13 times [2019-08-05 11:04:32,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:32,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:04:32,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 40 proven. 275 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-08-05 11:04:32,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:32,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:04:32,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:04:32,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:04:32,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:04:32,341 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 14 states. [2019-08-05 11:04:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:32,963 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-08-05 11:04:32,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:04:32,964 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-08-05 11:04:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:32,965 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:04:32,965 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:04:32,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=314, Invalid=876, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:04:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:04:32,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-08-05 11:04:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:04:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2019-08-05 11:04:32,972 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 45 [2019-08-05 11:04:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:32,972 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2019-08-05 11:04:32,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:04:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2019-08-05 11:04:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:04:32,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:32,973 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 7, 6, 1, 1, 1] [2019-08-05 11:04:32,974 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:32,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:32,974 INFO L82 PathProgramCache]: Analyzing trace with hash -798442282, now seen corresponding path program 14 times [2019-08-05 11:04:32,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:33,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:04:33,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 337 proven. 139 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:04:33,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:33,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:04:33,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:04:33,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:04:33,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:04:33,315 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 13 states. [2019-08-05 11:04:33,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:33,601 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-08-05 11:04:33,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:04:33,602 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-08-05 11:04:33,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:33,603 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:04:33,603 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:04:33,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:33,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:04:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:04:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:04:33,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-08-05 11:04:33,612 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 55 [2019-08-05 11:04:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:33,612 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-08-05 11:04:33,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:04:33,613 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-08-05 11:04:33,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:04:33,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:33,617 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 7, 6, 1, 1, 1] [2019-08-05 11:04:33,617 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:33,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:33,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1122998896, now seen corresponding path program 15 times [2019-08-05 11:04:33,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:33,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:04:33,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 262 proven. 265 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 11:04:34,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:34,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:04:34,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:04:34,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:04:34,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:04:34,214 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 16 states. [2019-08-05 11:04:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:34,819 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-08-05 11:04:34,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:04:34,820 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2019-08-05 11:04:34,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:34,821 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:04:34,821 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:04:34,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=509, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:04:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:04:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-08-05 11:04:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:04:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-08-05 11:04:34,826 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 57 [2019-08-05 11:04:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:34,827 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-08-05 11:04:34,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:04:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-08-05 11:04:34,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:04:34,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:34,828 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 7, 6, 1, 1, 1] [2019-08-05 11:04:34,828 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:34,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:34,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1165200074, now seen corresponding path program 16 times [2019-08-05 11:04:34,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:34,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:04:34,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 57 proven. 518 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 11:04:35,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:35,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:04:35,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:04:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:04:35,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:04:35,576 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 16 states. [2019-08-05 11:04:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:36,103 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-08-05 11:04:36,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:04:36,104 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-08-05 11:04:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:36,105 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:04:36,105 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:04:36,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:04:36,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:04:36,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-08-05 11:04:36,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:04:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-08-05 11:04:36,111 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 59 [2019-08-05 11:04:36,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:36,111 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-08-05 11:04:36,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:04:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-08-05 11:04:36,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:04:36,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:36,113 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 8, 7, 1, 1, 1] [2019-08-05 11:04:36,113 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:36,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:36,113 INFO L82 PathProgramCache]: Analyzing trace with hash 38779921, now seen corresponding path program 17 times [2019-08-05 11:04:36,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:36,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:04:36,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 604 proven. 239 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:04:36,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:36,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:04:36,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:04:36,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:04:36,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:04:36,380 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 15 states. [2019-08-05 11:04:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:36,742 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-08-05 11:04:36,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:04:36,742 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 71 [2019-08-05 11:04:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:36,743 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:04:36,744 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:04:36,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:04:36,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:04:36,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:04:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:04:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-08-05 11:04:36,748 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 71 [2019-08-05 11:04:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:36,749 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-08-05 11:04:36,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:04:36,749 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-08-05 11:04:36,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:04:36,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:36,750 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 8, 7, 1, 1, 1] [2019-08-05 11:04:36,750 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:36,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:36,751 INFO L82 PathProgramCache]: Analyzing trace with hash 777193195, now seen corresponding path program 18 times [2019-08-05 11:04:36,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:36,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:04:36,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 499 proven. 411 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-08-05 11:04:37,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:37,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:04:37,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:04:37,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:04:37,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:04:37,141 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 18 states. [2019-08-05 11:04:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:37,768 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-08-05 11:04:37,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:04:37,769 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 73 [2019-08-05 11:04:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:37,770 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:04:37,770 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:04:37,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=322, Invalid=670, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:04:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:04:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-08-05 11:04:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:04:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-08-05 11:04:37,776 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 73 [2019-08-05 11:04:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:37,777 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-08-05 11:04:37,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:04:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-08-05 11:04:37,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:04:37,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:37,778 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 8, 7, 1, 1, 1] [2019-08-05 11:04:37,779 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:37,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:37,779 INFO L82 PathProgramCache]: Analyzing trace with hash -441596795, now seen corresponding path program 19 times [2019-08-05 11:04:37,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:37,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:04:37,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 77 proven. 896 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-08-05 11:04:38,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:38,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:04:38,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:04:38,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:04:38,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:04:38,314 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 18 states. [2019-08-05 11:04:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:39,493 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-08-05 11:04:39,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:04:39,493 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2019-08-05 11:04:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:39,494 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:04:39,495 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:04:39,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=695, Invalid=2167, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:04:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:04:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-08-05 11:04:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:04:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2019-08-05 11:04:39,499 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 75 [2019-08-05 11:04:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:39,500 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2019-08-05 11:04:39,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:04:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2019-08-05 11:04:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:04:39,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:39,501 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 9, 8, 1, 1, 1] [2019-08-05 11:04:39,501 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:39,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:39,502 INFO L82 PathProgramCache]: Analyzing trace with hash -570761562, now seen corresponding path program 20 times [2019-08-05 11:04:39,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:39,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:04:39,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 1010 proven. 377 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-08-05 11:04:40,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:40,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:04:40,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:04:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:04:40,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:04:40,337 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 17 states. [2019-08-05 11:04:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:40,764 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2019-08-05 11:04:40,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:04:40,766 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2019-08-05 11:04:40,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:40,767 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:04:40,767 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:04:40,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=311, Invalid=619, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:04:40,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:04:40,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 11:04:40,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:04:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-08-05 11:04:40,770 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 89 [2019-08-05 11:04:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:40,770 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-08-05 11:04:40,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:04:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-08-05 11:04:40,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:04:40,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:40,771 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 9, 8, 1, 1, 1] [2019-08-05 11:04:40,771 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:40,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:40,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1872025536, now seen corresponding path program 21 times [2019-08-05 11:04:40,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:40,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:04:40,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1612 backedges. 870 proven. 602 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-08-05 11:04:41,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:41,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:04:41,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:04:41,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:04:41,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:41,519 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 20 states. [2019-08-05 11:04:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:42,193 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2019-08-05 11:04:42,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:04:42,195 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 91 [2019-08-05 11:04:42,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:42,196 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:04:42,196 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:04:42,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=407, Invalid=853, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:04:42,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:04:42,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-08-05 11:04:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:04:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-08-05 11:04:42,199 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 91 [2019-08-05 11:04:42,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:42,200 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-08-05 11:04:42,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:04:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-08-05 11:04:42,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:04:42,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:42,201 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 9, 8, 1, 1, 1] [2019-08-05 11:04:42,201 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:42,202 INFO L82 PathProgramCache]: Analyzing trace with hash 574809242, now seen corresponding path program 22 times [2019-08-05 11:04:42,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:42,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:04:42,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1692 backedges. 100 proven. 1452 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-08-05 11:04:42,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:42,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:04:42,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:04:42,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:04:42,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:42,620 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 20 states. [2019-08-05 11:04:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:43,511 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2019-08-05 11:04:43,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:04:43,512 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 93 [2019-08-05 11:04:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:43,513 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:04:43,513 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:04:43,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=979, Invalid=3181, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:04:43,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:04:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-08-05 11:04:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:04:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2019-08-05 11:04:43,518 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 93 [2019-08-05 11:04:43,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:43,519 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2019-08-05 11:04:43,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:04:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2019-08-05 11:04:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:04:43,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:43,520 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 10, 9, 1, 1, 1] [2019-08-05 11:04:43,520 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:43,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1761415275, now seen corresponding path program 23 times [2019-08-05 11:04:43,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:43,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:04:43,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2369 backedges. 1598 proven. 559 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-08-05 11:04:44,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:44,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:04:44,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:04:44,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:04:44,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:44,283 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 19 states. [2019-08-05 11:04:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:44,878 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-08-05 11:04:44,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:04:44,879 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2019-08-05 11:04:44,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:44,880 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:04:44,880 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:04:44,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:04:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:04:44,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 11:04:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:04:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-08-05 11:04:44,884 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 109 [2019-08-05 11:04:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:44,885 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-08-05 11:04:44,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:04:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-08-05 11:04:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:04:44,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:44,885 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 10, 9, 1, 1, 1] [2019-08-05 11:04:44,886 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:44,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:44,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1858734447, now seen corresponding path program 24 times [2019-08-05 11:04:44,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:44,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:04:44,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 1418 proven. 844 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-08-05 11:04:45,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:45,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:45,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:45,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:45,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:45,360 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 22 states. [2019-08-05 11:04:46,415 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-08-05 11:04:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:46,435 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2019-08-05 11:04:46,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:04:46,436 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2019-08-05 11:04:46,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:46,437 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:04:46,437 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:04:46,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=502, Invalid=1058, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:04:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:04:46,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-08-05 11:04:46,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:04:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-08-05 11:04:46,442 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 111 [2019-08-05 11:04:46,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:46,442 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-08-05 11:04:46,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-08-05 11:04:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:04:46,443 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:46,443 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 10, 9, 1, 1, 1] [2019-08-05 11:04:46,443 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:46,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:46,444 INFO L82 PathProgramCache]: Analyzing trace with hash -462539255, now seen corresponding path program 25 times [2019-08-05 11:04:46,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:46,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:04:46,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 126 proven. 2235 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-08-05 11:04:47,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:47,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:47,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:47,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:47,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:47,141 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 22 states. [2019-08-05 11:04:48,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:48,572 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-08-05 11:04:48,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:04:48,573 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 113 [2019-08-05 11:04:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:48,574 INFO L225 Difference]: With dead ends: 136 [2019-08-05 11:04:48,574 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 11:04:48,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1341, Invalid=4511, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:04:48,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 11:04:48,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-08-05 11:04:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:04:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2019-08-05 11:04:48,580 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 113 [2019-08-05 11:04:48,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:48,580 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2019-08-05 11:04:48,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2019-08-05 11:04:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 11:04:48,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:48,581 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 11, 10, 1, 1, 1] [2019-08-05 11:04:48,581 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1522557346, now seen corresponding path program 26 times [2019-08-05 11:04:48,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:48,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 1400 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:04:48,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3502 backedges. 2417 proven. 791 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-08-05 11:04:48,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:48,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:48,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:04:48,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:04:48,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:48,975 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 21 states. [2019-08-05 11:04:49,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:49,693 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2019-08-05 11:04:49,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:49,693 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 131 [2019-08-05 11:04:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:49,695 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:04:49,695 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 11:04:49,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=489, Invalid=993, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:04:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 11:04:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-08-05 11:04:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:04:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2019-08-05 11:04:49,699 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 131 [2019-08-05 11:04:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:49,699 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2019-08-05 11:04:49,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:04:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2019-08-05 11:04:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 11:04:49,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:49,701 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 11, 10, 1, 1, 1] [2019-08-05 11:04:49,701 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:49,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:49,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1088849416, now seen corresponding path program 27 times [2019-08-05 11:04:49,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:49,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:04:49,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3620 backedges. 2192 proven. 1143 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-08-05 11:04:50,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:50,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:04:50,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:04:50,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:04:50,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:04:50,204 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 24 states. [2019-08-05 11:04:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:51,327 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2019-08-05 11:04:51,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:04:51,328 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 133 [2019-08-05 11:04:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:51,329 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:04:51,329 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:04:51,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=607, Invalid=1285, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:04:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:04:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-08-05 11:04:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 11:04:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-08-05 11:04:51,335 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 133 [2019-08-05 11:04:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:51,335 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-08-05 11:04:51,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:04:51,335 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-08-05 11:04:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 11:04:51,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:51,336 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 11, 10, 1, 1, 1] [2019-08-05 11:04:51,336 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:51,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1587783762, now seen corresponding path program 28 times [2019-08-05 11:04:51,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:51,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 1436 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:04:51,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 155 proven. 3300 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-08-05 11:04:51,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:51,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:04:51,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:04:51,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:04:51,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:04:51,898 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 24 states. [2019-08-05 11:04:53,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:53,198 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-08-05 11:04:53,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:04:53,200 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 135 [2019-08-05 11:04:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:53,201 INFO L225 Difference]: With dead ends: 160 [2019-08-05 11:04:53,202 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 11:04:53,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2875 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1794, Invalid=6216, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:04:53,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 11:04:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-08-05 11:04:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 11:04:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 161 transitions. [2019-08-05 11:04:53,207 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 161 transitions. Word has length 135 [2019-08-05 11:04:53,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:53,208 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 161 transitions. [2019-08-05 11:04:53,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:04:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 161 transitions. [2019-08-05 11:04:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 11:04:53,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:53,209 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 12, 11, 1, 1, 1] [2019-08-05 11:04:53,209 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:53,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:53,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1450753793, now seen corresponding path program 29 times [2019-08-05 11:04:53,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:53,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:04:53,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4996 backedges. 3522 proven. 1079 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2019-08-05 11:04:53,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:53,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:04:53,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:04:53,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:04:53,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:53,749 INFO L87 Difference]: Start difference. First operand 158 states and 161 transitions. Second operand 23 states. [2019-08-05 11:04:54,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:54,529 INFO L93 Difference]: Finished difference Result 158 states and 159 transitions. [2019-08-05 11:04:54,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:04:54,530 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 155 [2019-08-05 11:04:54,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:54,531 INFO L225 Difference]: With dead ends: 158 [2019-08-05 11:04:54,531 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 11:04:54,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:04:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 11:04:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-08-05 11:04:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 11:04:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2019-08-05 11:04:54,536 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 155 [2019-08-05 11:04:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:54,536 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2019-08-05 11:04:54,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:04:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2019-08-05 11:04:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 11:04:54,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:54,537 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 12, 11, 1, 1, 1] [2019-08-05 11:04:54,538 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:54,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1367100891, now seen corresponding path program 30 times [2019-08-05 11:04:54,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:54,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 1656 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:04:54,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5137 backedges. 3247 proven. 1505 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-08-05 11:04:55,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:55,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:04:55,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:04:55,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:04:55,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:04:55,547 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 26 states. [2019-08-05 11:04:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:56,679 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2019-08-05 11:04:56,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:04:56,680 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 157 [2019-08-05 11:04:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:56,681 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:04:56,681 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:04:56,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=722, Invalid=1534, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:04:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:04:56,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-08-05 11:04:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 11:04:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2019-08-05 11:04:56,687 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 157 [2019-08-05 11:04:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:56,687 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2019-08-05 11:04:56,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:04:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2019-08-05 11:04:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 11:04:56,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:56,688 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 12, 11, 1, 1, 1] [2019-08-05 11:04:56,688 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash -475984011, now seen corresponding path program 31 times [2019-08-05 11:04:56,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:56,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:04:56,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5280 backedges. 187 proven. 4708 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-08-05 11:04:57,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:57,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:04:57,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:04:57,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:04:57,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:04:57,308 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 26 states. [2019-08-05 11:04:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:58,894 INFO L93 Difference]: Finished difference Result 186 states and 189 transitions. [2019-08-05 11:04:58,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:04:58,895 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 159 [2019-08-05 11:04:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:58,896 INFO L225 Difference]: With dead ends: 186 [2019-08-05 11:04:58,897 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 11:04:58,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4004 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2352, Invalid=8360, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:04:58,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 11:04:58,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-08-05 11:04:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 11:04:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 187 transitions. [2019-08-05 11:04:58,905 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 187 transitions. Word has length 159 [2019-08-05 11:04:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:58,905 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 187 transitions. [2019-08-05 11:04:58,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:04:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 187 transitions. [2019-08-05 11:04:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 11:04:58,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:58,906 INFO L399 BasicCegarLoop]: trace histogram [77, 76, 13, 12, 1, 1, 1] [2019-08-05 11:04:58,907 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:58,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1376523778, now seen corresponding path program 32 times [2019-08-05 11:04:58,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:59,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 1894 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:04:59,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6920 backedges. 4974 proven. 1429 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2019-08-05 11:04:59,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:59,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:04:59,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:04:59,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:04:59,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:04:59,698 INFO L87 Difference]: Start difference. First operand 184 states and 187 transitions. Second operand 25 states. [2019-08-05 11:05:00,379 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:05:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:01,141 INFO L93 Difference]: Finished difference Result 184 states and 185 transitions. [2019-08-05 11:05:01,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:01,142 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 181 [2019-08-05 11:05:01,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:01,143 INFO L225 Difference]: With dead ends: 184 [2019-08-05 11:05:01,143 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 11:05:01,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=707, Invalid=1455, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:05:01,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 11:05:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-08-05 11:05:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 11:05:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-08-05 11:05:01,147 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 181 [2019-08-05 11:05:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:01,147 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-08-05 11:05:01,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-08-05 11:05:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 11:05:01,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:01,149 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 13, 12, 1, 1, 1] [2019-08-05 11:05:01,149 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:01,149 INFO L82 PathProgramCache]: Analyzing trace with hash 53738904, now seen corresponding path program 33 times [2019-08-05 11:05:01,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:01,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 1912 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:05:01,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7086 backedges. 4644 proven. 1936 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-08-05 11:05:01,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:01,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:05:01,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:05:01,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:05:01,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:05:01,941 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 28 states. [2019-08-05 11:05:03,558 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-08-05 11:05:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:03,913 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2019-08-05 11:05:03,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:05:03,916 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 183 [2019-08-05 11:05:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:03,917 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:05:03,917 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:05:03,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=847, Invalid=1805, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:05:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:05:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-08-05 11:05:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 11:05:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 188 transitions. [2019-08-05 11:05:03,921 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 188 transitions. Word has length 183 [2019-08-05 11:05:03,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:03,922 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 188 transitions. [2019-08-05 11:05:03,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:05:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 188 transitions. [2019-08-05 11:05:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 11:05:03,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:03,923 INFO L399 BasicCegarLoop]: trace histogram [79, 78, 13, 12, 1, 1, 1] [2019-08-05 11:05:03,923 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:03,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:03,924 INFO L82 PathProgramCache]: Analyzing trace with hash 103531506, now seen corresponding path program 34 times [2019-08-05 11:05:03,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:04,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:05:04,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:04,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7254 backedges. 222 proven. 6526 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-08-05 11:05:04,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:04,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:05:04,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:05:04,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:05:04,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:05:04,876 INFO L87 Difference]: Start difference. First operand 186 states and 188 transitions. Second operand 28 states. [2019-08-05 11:05:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:06,839 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-08-05 11:05:06,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:05:06,839 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 185 [2019-08-05 11:05:06,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:06,841 INFO L225 Difference]: With dead ends: 214 [2019-08-05 11:05:06,841 INFO L226 Difference]: Without dead ends: 214 [2019-08-05 11:05:06,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5438 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3030, Invalid=11012, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:05:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-05 11:05:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-08-05 11:05:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 11:05:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 215 transitions. [2019-08-05 11:05:06,848 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 215 transitions. Word has length 185 [2019-08-05 11:05:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:06,849 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 215 transitions. [2019-08-05 11:05:06,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:05:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 215 transitions. [2019-08-05 11:05:06,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-08-05 11:05:06,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:06,851 INFO L399 BasicCegarLoop]: trace histogram [90, 89, 14, 13, 1, 1, 1] [2019-08-05 11:05:06,851 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:06,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:06,851 INFO L82 PathProgramCache]: Analyzing trace with hash 652639317, now seen corresponding path program 35 times [2019-08-05 11:05:06,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:07,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 2168 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:05:07,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9349 backedges. 6840 proven. 1847 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2019-08-05 11:05:09,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:09,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:05:09,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:05:09,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:05:09,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:05:09,610 INFO L87 Difference]: Start difference. First operand 212 states and 215 transitions. Second operand 27 states. [2019-08-05 11:05:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:10,654 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2019-08-05 11:05:10,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:05:10,655 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 209 [2019-08-05 11:05:10,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:10,657 INFO L225 Difference]: With dead ends: 212 [2019-08-05 11:05:10,657 INFO L226 Difference]: Without dead ends: 212 [2019-08-05 11:05:10,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:05:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-08-05 11:05:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-08-05 11:05:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 11:05:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2019-08-05 11:05:10,662 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 209 [2019-08-05 11:05:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:10,662 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2019-08-05 11:05:10,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:05:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2019-08-05 11:05:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-08-05 11:05:10,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:10,664 INFO L399 BasicCegarLoop]: trace histogram [91, 90, 14, 13, 1, 1, 1] [2019-08-05 11:05:10,664 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:10,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:10,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1399675345, now seen corresponding path program 36 times [2019-08-05 11:05:10,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:10,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 2186 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:05:10,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9542 backedges. 6450 proven. 2442 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-08-05 11:05:12,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:12,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:05:12,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:05:12,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:05:12,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:05:12,214 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 30 states. [2019-08-05 11:05:13,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:13,389 INFO L93 Difference]: Finished difference Result 215 states and 217 transitions. [2019-08-05 11:05:13,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:05:13,390 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 211 [2019-08-05 11:05:13,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:13,392 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:05:13,392 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:05:13,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=982, Invalid=2098, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:05:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:05:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-08-05 11:05:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-08-05 11:05:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 216 transitions. [2019-08-05 11:05:13,397 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 216 transitions. Word has length 211 [2019-08-05 11:05:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:13,397 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 216 transitions. [2019-08-05 11:05:13,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:05:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 216 transitions. [2019-08-05 11:05:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-08-05 11:05:13,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:13,399 INFO L399 BasicCegarLoop]: trace histogram [92, 91, 14, 13, 1, 1, 1] [2019-08-05 11:05:13,399 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:13,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:13,399 INFO L82 PathProgramCache]: Analyzing trace with hash -763190583, now seen corresponding path program 37 times [2019-08-05 11:05:13,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:13,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 2204 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:05:13,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9737 backedges. 260 proven. 8827 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-08-05 11:05:14,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:14,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:05:14,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:05:14,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:05:14,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:05:14,153 INFO L87 Difference]: Start difference. First operand 214 states and 216 transitions. Second operand 30 states. [2019-08-05 11:05:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:16,653 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-08-05 11:05:16,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 11:05:16,654 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 213 [2019-08-05 11:05:16,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:16,656 INFO L225 Difference]: With dead ends: 244 [2019-08-05 11:05:16,656 INFO L226 Difference]: Without dead ends: 244 [2019-08-05 11:05:16,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7228 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3844, Invalid=14246, Unknown=0, NotChecked=0, Total=18090 [2019-08-05 11:05:16,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-08-05 11:05:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2019-08-05 11:05:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-08-05 11:05:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 245 transitions. [2019-08-05 11:05:16,662 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 245 transitions. Word has length 213 [2019-08-05 11:05:16,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:16,663 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 245 transitions. [2019-08-05 11:05:16,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:05:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 245 transitions. [2019-08-05 11:05:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-08-05 11:05:16,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:16,664 INFO L399 BasicCegarLoop]: trace histogram [104, 103, 15, 14, 1, 1, 1] [2019-08-05 11:05:16,664 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:16,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:16,665 INFO L82 PathProgramCache]: Analyzing trace with hash -475269242, now seen corresponding path program 38 times [2019-08-05 11:05:16,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:16,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 2460 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:05:16,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12364 backedges. 9193 proven. 2339 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2019-08-05 11:05:17,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:17,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:05:17,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:05:17,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:05:17,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:05:17,334 INFO L87 Difference]: Start difference. First operand 242 states and 245 transitions. Second operand 29 states. [2019-08-05 11:05:18,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:18,556 INFO L93 Difference]: Finished difference Result 242 states and 243 transitions. [2019-08-05 11:05:18,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:05:18,556 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 239 [2019-08-05 11:05:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:18,558 INFO L225 Difference]: With dead ends: 242 [2019-08-05 11:05:18,558 INFO L226 Difference]: Without dead ends: 242 [2019-08-05 11:05:18,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:05:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-08-05 11:05:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-08-05 11:05:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-08-05 11:05:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 243 transitions. [2019-08-05 11:05:18,563 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 243 transitions. Word has length 239 [2019-08-05 11:05:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:18,564 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 243 transitions. [2019-08-05 11:05:18,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:05:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 243 transitions. [2019-08-05 11:05:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-08-05 11:05:18,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:18,566 INFO L399 BasicCegarLoop]: trace histogram [105, 104, 15, 14, 1, 1, 1] [2019-08-05 11:05:18,566 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:18,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1545169184, now seen corresponding path program 39 times [2019-08-05 11:05:18,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:18,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 2478 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:05:18,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:19,156 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:05:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12586 backedges. 8738 proven. 3029 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2019-08-05 11:05:19,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:19,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:05:19,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:05:19,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:05:19,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:05:19,973 INFO L87 Difference]: Start difference. First operand 242 states and 243 transitions. Second operand 32 states. [2019-08-05 11:05:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:21,682 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2019-08-05 11:05:21,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:05:21,683 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 241 [2019-08-05 11:05:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:21,685 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:05:21,685 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:05:21,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1127, Invalid=2413, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:05:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:05:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2019-08-05 11:05:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-08-05 11:05:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 246 transitions. [2019-08-05 11:05:21,689 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 246 transitions. Word has length 241 [2019-08-05 11:05:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:21,689 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 246 transitions. [2019-08-05 11:05:21,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:05:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 246 transitions. [2019-08-05 11:05:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-08-05 11:05:21,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:21,690 INFO L399 BasicCegarLoop]: trace histogram [106, 105, 15, 14, 1, 1, 1] [2019-08-05 11:05:21,691 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:21,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:21,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1151046278, now seen corresponding path program 40 times [2019-08-05 11:05:21,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:21,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 2496 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:05:21,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12810 backedges. 301 proven. 11690 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2019-08-05 11:05:22,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:22,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:05:22,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:05:22,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:05:22,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:05:22,498 INFO L87 Difference]: Start difference. First operand 244 states and 246 transitions. Second operand 32 states. [2019-08-05 11:05:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:25,325 INFO L93 Difference]: Finished difference Result 276 states and 279 transitions. [2019-08-05 11:05:25,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-08-05 11:05:25,325 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 243 [2019-08-05 11:05:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:25,327 INFO L225 Difference]: With dead ends: 276 [2019-08-05 11:05:25,327 INFO L226 Difference]: Without dead ends: 276 [2019-08-05 11:05:25,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9429 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4811, Invalid=18141, Unknown=0, NotChecked=0, Total=22952 [2019-08-05 11:05:25,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-08-05 11:05:25,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2019-08-05 11:05:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-08-05 11:05:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 277 transitions. [2019-08-05 11:05:25,334 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 277 transitions. Word has length 243 [2019-08-05 11:05:25,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:25,334 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 277 transitions. [2019-08-05 11:05:25,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:05:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 277 transitions. [2019-08-05 11:05:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-08-05 11:05:25,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:25,336 INFO L399 BasicCegarLoop]: trace histogram [119, 118, 16, 15, 1, 1, 1] [2019-08-05 11:05:25,336 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:25,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:25,336 INFO L82 PathProgramCache]: Analyzing trace with hash 7913873, now seen corresponding path program 41 times [2019-08-05 11:05:25,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:25,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 2770 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:05:25,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16052 backedges. 12112 proven. 2911 refuted. 0 times theorem prover too weak. 1029 trivial. 0 not checked. [2019-08-05 11:05:26,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:26,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:05:26,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:05:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:05:26,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:05:26,330 INFO L87 Difference]: Start difference. First operand 274 states and 277 transitions. Second operand 31 states. [2019-08-05 11:05:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:27,437 INFO L93 Difference]: Finished difference Result 274 states and 275 transitions. [2019-08-05 11:05:27,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:05:27,438 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 271 [2019-08-05 11:05:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:27,440 INFO L225 Difference]: With dead ends: 274 [2019-08-05 11:05:27,440 INFO L226 Difference]: Without dead ends: 274 [2019-08-05 11:05:27,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1109, Invalid=2313, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:05:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-08-05 11:05:27,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2019-08-05 11:05:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-08-05 11:05:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 275 transitions. [2019-08-05 11:05:27,445 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 275 transitions. Word has length 271 [2019-08-05 11:05:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:27,445 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 275 transitions. [2019-08-05 11:05:27,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:05:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 275 transitions. [2019-08-05 11:05:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-08-05 11:05:27,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:27,446 INFO L399 BasicCegarLoop]: trace histogram [120, 119, 16, 15, 1, 1, 1] [2019-08-05 11:05:27,447 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:27,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:27,447 INFO L82 PathProgramCache]: Analyzing trace with hash -948229013, now seen corresponding path program 42 times [2019-08-05 11:05:27,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:27,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 2788 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:05:27,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 16305 backedges. 11587 proven. 3703 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-08-05 11:05:28,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:28,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:05:28,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:05:28,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:05:28,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:05:28,590 INFO L87 Difference]: Start difference. First operand 274 states and 275 transitions. Second operand 34 states. [2019-08-05 11:05:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:30,432 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2019-08-05 11:05:30,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:05:30,432 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 273 [2019-08-05 11:05:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:30,434 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:05:30,434 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:05:30,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1282, Invalid=2750, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:05:30,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:05:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2019-08-05 11:05:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-08-05 11:05:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-08-05 11:05:30,439 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 273 [2019-08-05 11:05:30,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:30,439 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-08-05 11:05:30,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:05:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-08-05 11:05:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-08-05 11:05:30,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:30,440 INFO L399 BasicCegarLoop]: trace histogram [121, 120, 16, 15, 1, 1, 1] [2019-08-05 11:05:30,441 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:30,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:30,441 INFO L82 PathProgramCache]: Analyzing trace with hash -714962427, now seen corresponding path program 43 times [2019-08-05 11:05:30,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:30,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 2806 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:05:30,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16560 backedges. 345 proven. 15200 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-08-05 11:05:31,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:31,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:05:31,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:05:31,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:05:31,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:05:31,305 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 34 states. [2019-08-05 11:05:34,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:34,411 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-08-05 11:05:34,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-08-05 11:05:34,411 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 275 [2019-08-05 11:05:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:34,414 INFO L225 Difference]: With dead ends: 310 [2019-08-05 11:05:34,414 INFO L226 Difference]: Without dead ends: 310 [2019-08-05 11:05:34,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12100 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5949, Invalid=22781, Unknown=0, NotChecked=0, Total=28730 [2019-08-05 11:05:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-08-05 11:05:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-08-05 11:05:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-08-05 11:05:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 311 transitions. [2019-08-05 11:05:34,419 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 311 transitions. Word has length 275 [2019-08-05 11:05:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:34,420 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 311 transitions. [2019-08-05 11:05:34,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:05:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 311 transitions. [2019-08-05 11:05:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-08-05 11:05:34,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:34,422 INFO L399 BasicCegarLoop]: trace histogram [135, 134, 17, 16, 1, 1, 1] [2019-08-05 11:05:34,422 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:34,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:34,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1625733898, now seen corresponding path program 44 times [2019-08-05 11:05:34,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:34,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 3098 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:05:34,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 20506 backedges. 15682 proven. 3569 refuted. 0 times theorem prover too weak. 1255 trivial. 0 not checked. [2019-08-05 11:05:35,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:35,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:05:35,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:05:35,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:05:35,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:05:35,670 INFO L87 Difference]: Start difference. First operand 308 states and 311 transitions. Second operand 33 states. [2019-08-05 11:05:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:37,068 INFO L93 Difference]: Finished difference Result 308 states and 309 transitions. [2019-08-05 11:05:37,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:05:37,069 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 305 [2019-08-05 11:05:37,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:37,071 INFO L225 Difference]: With dead ends: 308 [2019-08-05 11:05:37,071 INFO L226 Difference]: Without dead ends: 308 [2019-08-05 11:05:37,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1263, Invalid=2643, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:05:37,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-08-05 11:05:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2019-08-05 11:05:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-08-05 11:05:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 309 transitions. [2019-08-05 11:05:37,076 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 309 transitions. Word has length 305 [2019-08-05 11:05:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:37,077 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 309 transitions. [2019-08-05 11:05:37,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:05:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 309 transitions. [2019-08-05 11:05:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-08-05 11:05:37,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:37,079 INFO L399 BasicCegarLoop]: trace histogram [136, 135, 17, 16, 1, 1, 1] [2019-08-05 11:05:37,079 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:37,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:37,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1679014544, now seen corresponding path program 45 times [2019-08-05 11:05:37,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:37,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 3116 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:05:37,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 20792 backedges. 15082 proven. 4470 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2019-08-05 11:05:38,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:38,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:05:38,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:05:38,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:05:38,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:05:38,213 INFO L87 Difference]: Start difference. First operand 308 states and 309 transitions. Second operand 36 states. [2019-08-05 11:05:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:39,648 INFO L93 Difference]: Finished difference Result 311 states and 313 transitions. [2019-08-05 11:05:39,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:05:39,649 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 307 [2019-08-05 11:05:39,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:39,651 INFO L225 Difference]: With dead ends: 311 [2019-08-05 11:05:39,651 INFO L226 Difference]: Without dead ends: 311 [2019-08-05 11:05:39,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1447, Invalid=3109, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:05:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-08-05 11:05:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 310. [2019-08-05 11:05:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-08-05 11:05:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 312 transitions. [2019-08-05 11:05:39,656 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 312 transitions. Word has length 307 [2019-08-05 11:05:39,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:39,656 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 312 transitions. [2019-08-05 11:05:39,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:05:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 312 transitions. [2019-08-05 11:05:39,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-08-05 11:05:39,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:39,658 INFO L399 BasicCegarLoop]: trace histogram [137, 136, 17, 16, 1, 1, 1] [2019-08-05 11:05:39,659 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:39,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:39,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1374674198, now seen corresponding path program 46 times [2019-08-05 11:05:39,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:40,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 3134 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:05:40,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 21080 backedges. 392 proven. 19448 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2019-08-05 11:05:40,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:40,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:05:40,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:05:40,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:05:40,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:05:40,975 INFO L87 Difference]: Start difference. First operand 310 states and 312 transitions. Second operand 36 states. [2019-08-05 11:05:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:44,616 INFO L93 Difference]: Finished difference Result 346 states and 349 transitions. [2019-08-05 11:05:44,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-08-05 11:05:44,617 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 309 [2019-08-05 11:05:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:44,620 INFO L225 Difference]: With dead ends: 346 [2019-08-05 11:05:44,620 INFO L226 Difference]: Without dead ends: 346 [2019-08-05 11:05:44,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15304 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=7277, Invalid=28255, Unknown=0, NotChecked=0, Total=35532 [2019-08-05 11:05:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-08-05 11:05:44,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2019-08-05 11:05:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-08-05 11:05:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 347 transitions. [2019-08-05 11:05:44,626 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 347 transitions. Word has length 309 [2019-08-05 11:05:44,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:44,626 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 347 transitions. [2019-08-05 11:05:44,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:05:44,626 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 347 transitions. [2019-08-05 11:05:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-08-05 11:05:44,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:44,629 INFO L399 BasicCegarLoop]: trace histogram [152, 151, 18, 17, 1, 1, 1] [2019-08-05 11:05:44,629 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:44,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:44,629 INFO L82 PathProgramCache]: Analyzing trace with hash -869961547, now seen corresponding path program 47 times [2019-08-05 11:05:44,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:45,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 3444 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:05:45,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 25825 backedges. 19994 proven. 4319 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-08-05 11:05:45,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:45,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:05:45,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:05:45,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:05:45,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:05:45,863 INFO L87 Difference]: Start difference. First operand 344 states and 347 transitions. Second operand 35 states. [2019-08-05 11:05:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:47,274 INFO L93 Difference]: Finished difference Result 344 states and 345 transitions. [2019-08-05 11:05:47,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:05:47,275 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 341 [2019-08-05 11:05:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:47,277 INFO L225 Difference]: With dead ends: 344 [2019-08-05 11:05:47,277 INFO L226 Difference]: Without dead ends: 344 [2019-08-05 11:05:47,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1427, Invalid=2995, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:05:47,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-08-05 11:05:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-08-05 11:05:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-08-05 11:05:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 345 transitions. [2019-08-05 11:05:47,282 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 345 transitions. Word has length 341 [2019-08-05 11:05:47,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:47,283 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 345 transitions. [2019-08-05 11:05:47,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:05:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 345 transitions. [2019-08-05 11:05:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-08-05 11:05:47,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:47,285 INFO L399 BasicCegarLoop]: trace histogram [153, 152, 18, 17, 1, 1, 1] [2019-08-05 11:05:47,285 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:47,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:47,286 INFO L82 PathProgramCache]: Analyzing trace with hash -851754353, now seen corresponding path program 48 times [2019-08-05 11:05:47,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:47,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 3462 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:05:47,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 26146 backedges. 19314 proven. 5336 refuted. 0 times theorem prover too weak. 1496 trivial. 0 not checked. [2019-08-05 11:05:49,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:49,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:05:49,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:05:49,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:05:49,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1059, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:05:49,591 INFO L87 Difference]: Start difference. First operand 344 states and 345 transitions. Second operand 38 states. [2019-08-05 11:05:51,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:51,612 INFO L93 Difference]: Finished difference Result 347 states and 349 transitions. [2019-08-05 11:05:51,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:05:51,613 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 343 [2019-08-05 11:05:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:51,615 INFO L225 Difference]: With dead ends: 347 [2019-08-05 11:05:51,615 INFO L226 Difference]: Without dead ends: 347 [2019-08-05 11:05:51,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1622, Invalid=3490, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:05:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-08-05 11:05:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 346. [2019-08-05 11:05:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-08-05 11:05:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 348 transitions. [2019-08-05 11:05:51,621 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 348 transitions. Word has length 343 [2019-08-05 11:05:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:51,621 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 348 transitions. [2019-08-05 11:05:51,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:05:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 348 transitions. [2019-08-05 11:05:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-08-05 11:05:51,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:51,623 INFO L399 BasicCegarLoop]: trace histogram [154, 153, 18, 17, 1, 1, 1] [2019-08-05 11:05:51,624 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:51,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:51,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1802872617, now seen corresponding path program 49 times [2019-08-05 11:05:51,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:52,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 3480 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:05:52,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 26469 backedges. 442 proven. 24531 refuted. 0 times theorem prover too weak. 1496 trivial. 0 not checked. [2019-08-05 11:05:52,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:52,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:05:52,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:05:52,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:05:52,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:05:52,785 INFO L87 Difference]: Start difference. First operand 346 states and 348 transitions. Second operand 38 states. [2019-08-05 11:05:56,930 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:05:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:57,246 INFO L93 Difference]: Finished difference Result 384 states and 387 transitions. [2019-08-05 11:05:57,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-08-05 11:05:57,246 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 345 [2019-08-05 11:05:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:57,249 INFO L225 Difference]: With dead ends: 384 [2019-08-05 11:05:57,249 INFO L226 Difference]: Without dead ends: 384 [2019-08-05 11:05:57,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19108 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8815, Invalid=34657, Unknown=0, NotChecked=0, Total=43472 [2019-08-05 11:05:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-08-05 11:05:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2019-08-05 11:05:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-08-05 11:05:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 385 transitions. [2019-08-05 11:05:57,253 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 385 transitions. Word has length 345 [2019-08-05 11:05:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:57,254 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 385 transitions. [2019-08-05 11:05:57,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:05:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 385 transitions. [2019-08-05 11:05:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-08-05 11:05:57,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:57,256 INFO L399 BasicCegarLoop]: trace histogram [170, 169, 19, 18, 1, 1, 1] [2019-08-05 11:05:57,256 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1897359282, now seen corresponding path program 50 times [2019-08-05 11:05:57,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:57,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 3808 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:05:57,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 32114 backedges. 25145 proven. 5167 refuted. 0 times theorem prover too weak. 1802 trivial. 0 not checked. [2019-08-05 11:05:58,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:58,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:05:58,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:05:58,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:05:58,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:05:58,539 INFO L87 Difference]: Start difference. First operand 382 states and 385 transitions. Second operand 37 states. [2019-08-05 11:05:59,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:59,867 INFO L93 Difference]: Finished difference Result 382 states and 383 transitions. [2019-08-05 11:05:59,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:05:59,868 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 379 [2019-08-05 11:05:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:59,870 INFO L225 Difference]: With dead ends: 382 [2019-08-05 11:05:59,870 INFO L226 Difference]: Without dead ends: 382 [2019-08-05 11:05:59,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1601, Invalid=3369, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:05:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-08-05 11:05:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-08-05 11:05:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-08-05 11:05:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 383 transitions. [2019-08-05 11:05:59,875 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 383 transitions. Word has length 379 [2019-08-05 11:05:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:59,876 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 383 transitions. [2019-08-05 11:05:59,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:05:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 383 transitions. [2019-08-05 11:05:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-08-05 11:05:59,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:59,878 INFO L399 BasicCegarLoop]: trace histogram [171, 170, 19, 18, 1, 1, 1] [2019-08-05 11:05:59,878 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:59,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2041985000, now seen corresponding path program 51 times [2019-08-05 11:05:59,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:00,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 3826 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:06:00,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 32472 backedges. 24380 proven. 6307 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2019-08-05 11:06:01,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:01,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:06:01,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:06:01,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:06:01,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:06:01,488 INFO L87 Difference]: Start difference. First operand 382 states and 383 transitions. Second operand 40 states. [2019-08-05 11:06:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:03,492 INFO L93 Difference]: Finished difference Result 385 states and 387 transitions. [2019-08-05 11:06:03,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:06:03,493 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 381 [2019-08-05 11:06:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:03,495 INFO L225 Difference]: With dead ends: 385 [2019-08-05 11:06:03,495 INFO L226 Difference]: Without dead ends: 385 [2019-08-05 11:06:03,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1807, Invalid=3893, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:06:03,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-08-05 11:06:03,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 384. [2019-08-05 11:06:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-08-05 11:06:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 386 transitions. [2019-08-05 11:06:03,499 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 386 transitions. Word has length 381 [2019-08-05 11:06:03,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:03,500 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 386 transitions. [2019-08-05 11:06:03,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:06:03,500 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 386 transitions. [2019-08-05 11:06:03,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-08-05 11:06:03,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:03,502 INFO L399 BasicCegarLoop]: trace histogram [172, 171, 19, 18, 1, 1, 1] [2019-08-05 11:06:03,503 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:03,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:03,503 INFO L82 PathProgramCache]: Analyzing trace with hash -452416958, now seen corresponding path program 52 times [2019-08-05 11:06:03,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:04,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 3844 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:06:04,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 32832 backedges. 495 proven. 30552 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2019-08-05 11:06:05,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:05,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:06:05,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:06:05,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:06:05,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:06:05,211 INFO L87 Difference]: Start difference. First operand 384 states and 386 transitions. Second operand 40 states. [2019-08-05 11:06:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:10,077 INFO L93 Difference]: Finished difference Result 424 states and 427 transitions. [2019-08-05 11:06:10,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2019-08-05 11:06:10,078 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 383 [2019-08-05 11:06:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:10,080 INFO L225 Difference]: With dead ends: 424 [2019-08-05 11:06:10,080 INFO L226 Difference]: Without dead ends: 424 [2019-08-05 11:06:10,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23583 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=10584, Invalid=42086, Unknown=0, NotChecked=0, Total=52670 [2019-08-05 11:06:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-08-05 11:06:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 422. [2019-08-05 11:06:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-08-05 11:06:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 425 transitions. [2019-08-05 11:06:10,088 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 425 transitions. Word has length 383 [2019-08-05 11:06:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:10,088 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 425 transitions. [2019-08-05 11:06:10,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:06:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 425 transitions. [2019-08-05 11:06:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-08-05 11:06:10,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:10,090 INFO L399 BasicCegarLoop]: trace histogram [189, 188, 20, 19, 1, 1, 1] [2019-08-05 11:06:10,090 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:10,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash -971656255, now seen corresponding path program 53 times [2019-08-05 11:06:10,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:10,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 4190 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:06:10,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 39484 backedges. 31238 proven. 6119 refuted. 0 times theorem prover too weak. 2127 trivial. 0 not checked. [2019-08-05 11:06:11,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:11,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:06:11,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:06:11,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:06:11,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:06:11,629 INFO L87 Difference]: Start difference. First operand 422 states and 425 transitions. Second operand 39 states. [2019-08-05 11:06:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:13,363 INFO L93 Difference]: Finished difference Result 422 states and 423 transitions. [2019-08-05 11:06:13,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:06:13,363 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 419 [2019-08-05 11:06:13,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:13,366 INFO L225 Difference]: With dead ends: 422 [2019-08-05 11:06:13,366 INFO L226 Difference]: Without dead ends: 422 [2019-08-05 11:06:13,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1785, Invalid=3765, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:06:13,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-08-05 11:06:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2019-08-05 11:06:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-08-05 11:06:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 423 transitions. [2019-08-05 11:06:13,372 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 423 transitions. Word has length 419 [2019-08-05 11:06:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:13,372 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 423 transitions. [2019-08-05 11:06:13,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:06:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 423 transitions. [2019-08-05 11:06:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-08-05 11:06:13,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:13,375 INFO L399 BasicCegarLoop]: trace histogram [190, 189, 20, 19, 1, 1, 1] [2019-08-05 11:06:13,375 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:13,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1012503195, now seen corresponding path program 54 times [2019-08-05 11:06:13,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:13,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 4208 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:06:13,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 39881 backedges. 30383 proven. 7389 refuted. 0 times theorem prover too weak. 2109 trivial. 0 not checked. [2019-08-05 11:06:14,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:14,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:06:14,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:06:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:06:14,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=1297, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:06:14,894 INFO L87 Difference]: Start difference. First operand 422 states and 423 transitions. Second operand 42 states. [2019-08-05 11:06:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:17,279 INFO L93 Difference]: Finished difference Result 425 states and 427 transitions. [2019-08-05 11:06:17,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:06:17,280 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 421 [2019-08-05 11:06:17,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:17,282 INFO L225 Difference]: With dead ends: 425 [2019-08-05 11:06:17,282 INFO L226 Difference]: Without dead ends: 425 [2019-08-05 11:06:17,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2002, Invalid=4318, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:06:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-08-05 11:06:17,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 424. [2019-08-05 11:06:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-08-05 11:06:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 426 transitions. [2019-08-05 11:06:17,287 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 426 transitions. Word has length 421 [2019-08-05 11:06:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:17,288 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 426 transitions. [2019-08-05 11:06:17,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:06:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 426 transitions. [2019-08-05 11:06:17,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-08-05 11:06:17,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:17,290 INFO L399 BasicCegarLoop]: trace histogram [191, 190, 20, 19, 1, 1, 1] [2019-08-05 11:06:17,290 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:17,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:17,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1941953483, now seen corresponding path program 55 times [2019-08-05 11:06:17,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:17,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 4226 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:06:17,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 40280 backedges. 551 proven. 37620 refuted. 0 times theorem prover too weak. 2109 trivial. 0 not checked. [2019-08-05 11:06:18,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:18,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:06:18,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:06:18,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:06:18,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:06:18,980 INFO L87 Difference]: Start difference. First operand 424 states and 426 transitions. Second operand 42 states. [2019-08-05 11:06:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:25,334 INFO L93 Difference]: Finished difference Result 466 states and 469 transitions. [2019-08-05 11:06:25,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2019-08-05 11:06:25,335 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 423 [2019-08-05 11:06:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:25,338 INFO L225 Difference]: With dead ends: 466 [2019-08-05 11:06:25,338 INFO L226 Difference]: Without dead ends: 466 [2019-08-05 11:06:25,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28804 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=12606, Invalid=50646, Unknown=0, NotChecked=0, Total=63252 [2019-08-05 11:06:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-08-05 11:06:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 464. [2019-08-05 11:06:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-08-05 11:06:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 467 transitions. [2019-08-05 11:06:25,347 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 467 transitions. Word has length 423 [2019-08-05 11:06:25,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:25,348 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 467 transitions. [2019-08-05 11:06:25,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:06:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 467 transitions. [2019-08-05 11:06:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-08-05 11:06:25,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:25,351 INFO L399 BasicCegarLoop]: trace histogram [209, 208, 21, 20, 1, 1, 1] [2019-08-05 11:06:25,351 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:25,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:25,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1580728206, now seen corresponding path program 56 times [2019-08-05 11:06:25,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:26,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 4590 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:06:26,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 48052 backedges. 38382 proven. 7181 refuted. 0 times theorem prover too weak. 2489 trivial. 0 not checked. [2019-08-05 11:06:27,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:27,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:06:27,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:06:27,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:06:27,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:06:27,258 INFO L87 Difference]: Start difference. First operand 464 states and 467 transitions. Second operand 41 states. [2019-08-05 11:06:29,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:29,017 INFO L93 Difference]: Finished difference Result 464 states and 465 transitions. [2019-08-05 11:06:29,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:06:29,017 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 461 [2019-08-05 11:06:29,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:29,020 INFO L225 Difference]: With dead ends: 464 [2019-08-05 11:06:29,020 INFO L226 Difference]: Without dead ends: 464 [2019-08-05 11:06:29,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1979, Invalid=4183, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:06:29,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-08-05 11:06:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-08-05 11:06:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-08-05 11:06:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 465 transitions. [2019-08-05 11:06:29,025 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 465 transitions. Word has length 461 [2019-08-05 11:06:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:29,025 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 465 transitions. [2019-08-05 11:06:29,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:06:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 465 transitions. [2019-08-05 11:06:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-08-05 11:06:29,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:29,027 INFO L399 BasicCegarLoop]: trace histogram [210, 209, 21, 20, 1, 1, 1] [2019-08-05 11:06:29,027 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:29,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1596756184, now seen corresponding path program 57 times [2019-08-05 11:06:29,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:29,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 4608 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:06:29,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 48490 backedges. 37432 proven. 8588 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-08-05 11:06:30,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:30,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:06:30,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:06:30,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:06:30,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=1425, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:06:30,860 INFO L87 Difference]: Start difference. First operand 464 states and 465 transitions. Second operand 44 states. [2019-08-05 11:06:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:33,437 INFO L93 Difference]: Finished difference Result 467 states and 469 transitions. [2019-08-05 11:06:33,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:06:33,438 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 463 [2019-08-05 11:06:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:33,440 INFO L225 Difference]: With dead ends: 467 [2019-08-05 11:06:33,441 INFO L226 Difference]: Without dead ends: 467 [2019-08-05 11:06:33,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2207, Invalid=4765, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:06:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-08-05 11:06:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 466. [2019-08-05 11:06:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-08-05 11:06:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 468 transitions. [2019-08-05 11:06:33,446 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 468 transitions. Word has length 463 [2019-08-05 11:06:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:33,447 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 468 transitions. [2019-08-05 11:06:33,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:06:33,447 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 468 transitions. [2019-08-05 11:06:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-08-05 11:06:33,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:33,450 INFO L399 BasicCegarLoop]: trace histogram [211, 210, 21, 20, 1, 1, 1] [2019-08-05 11:06:33,450 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:33,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:33,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1179315838, now seen corresponding path program 58 times [2019-08-05 11:06:33,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:34,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 4626 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:06:34,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 48930 backedges. 610 proven. 45850 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-08-05 11:06:35,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:35,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:06:35,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:06:35,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:06:35,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:06:35,181 INFO L87 Difference]: Start difference. First operand 466 states and 468 transitions. Second operand 44 states. [2019-08-05 11:06:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:41,318 INFO L93 Difference]: Finished difference Result 510 states and 513 transitions. [2019-08-05 11:06:41,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2019-08-05 11:06:41,319 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 465 [2019-08-05 11:06:41,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:41,322 INFO L225 Difference]: With dead ends: 510 [2019-08-05 11:06:41,322 INFO L226 Difference]: Without dead ends: 510 [2019-08-05 11:06:41,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34850 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=14904, Invalid=60446, Unknown=0, NotChecked=0, Total=75350 [2019-08-05 11:06:41,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-08-05 11:06:41,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2019-08-05 11:06:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-08-05 11:06:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 511 transitions. [2019-08-05 11:06:41,330 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 511 transitions. Word has length 465 [2019-08-05 11:06:41,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:41,331 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 511 transitions. [2019-08-05 11:06:41,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:06:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 511 transitions. [2019-08-05 11:06:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-08-05 11:06:41,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:41,334 INFO L399 BasicCegarLoop]: trace histogram [230, 229, 22, 21, 1, 1, 1] [2019-08-05 11:06:41,334 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:41,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash -307757899, now seen corresponding path program 59 times [2019-08-05 11:06:41,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:42,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 5008 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:06:42,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 57941 backedges. 46692 proven. 8359 refuted. 0 times theorem prover too weak. 2890 trivial. 0 not checked. [2019-08-05 11:06:42,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:42,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:06:42,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:06:42,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:06:42,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:06:42,986 INFO L87 Difference]: Start difference. First operand 508 states and 511 transitions. Second operand 43 states. [2019-08-05 11:06:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:44,880 INFO L93 Difference]: Finished difference Result 508 states and 509 transitions. [2019-08-05 11:06:44,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:06:44,880 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 505 [2019-08-05 11:06:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:44,883 INFO L225 Difference]: With dead ends: 508 [2019-08-05 11:06:44,883 INFO L226 Difference]: Without dead ends: 508 [2019-08-05 11:06:44,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2183, Invalid=4623, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:06:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-08-05 11:06:44,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2019-08-05 11:06:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-08-05 11:06:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 509 transitions. [2019-08-05 11:06:44,888 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 509 transitions. Word has length 505 [2019-08-05 11:06:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:44,888 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 509 transitions. [2019-08-05 11:06:44,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:06:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 509 transitions. [2019-08-05 11:06:44,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-08-05 11:06:44,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:44,892 INFO L399 BasicCegarLoop]: trace histogram [231, 230, 22, 21, 1, 1, 1] [2019-08-05 11:06:44,892 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:44,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:44,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1583353487, now seen corresponding path program 60 times [2019-08-05 11:06:44,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:45,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 5026 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:06:45,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 58422 backedges. 45642 proven. 9910 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked. [2019-08-05 11:06:47,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:47,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:06:47,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:06:47,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:06:47,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=1559, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:06:47,006 INFO L87 Difference]: Start difference. First operand 508 states and 509 transitions. Second operand 46 states. [2019-08-05 11:06:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:49,490 INFO L93 Difference]: Finished difference Result 511 states and 513 transitions. [2019-08-05 11:06:49,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:06:49,490 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 507 [2019-08-05 11:06:49,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:49,493 INFO L225 Difference]: With dead ends: 511 [2019-08-05 11:06:49,493 INFO L226 Difference]: Without dead ends: 511 [2019-08-05 11:06:49,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2422, Invalid=5234, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:06:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-08-05 11:06:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 510. [2019-08-05 11:06:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-08-05 11:06:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 512 transitions. [2019-08-05 11:06:49,498 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 512 transitions. Word has length 507 [2019-08-05 11:06:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:49,498 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 512 transitions. [2019-08-05 11:06:49,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:06:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 512 transitions. [2019-08-05 11:06:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-08-05 11:06:49,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:49,501 INFO L399 BasicCegarLoop]: trace histogram [232, 231, 22, 21, 1, 1, 1] [2019-08-05 11:06:49,501 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:49,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:49,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1184330537, now seen corresponding path program 61 times [2019-08-05 11:06:49,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:50,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 5044 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:06:50,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 58905 backedges. 672 proven. 55363 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked. [2019-08-05 11:06:51,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:51,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:06:51,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:06:51,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:06:51,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:06:51,374 INFO L87 Difference]: Start difference. First operand 510 states and 512 transitions. Second operand 46 states. [2019-08-05 11:06:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:58,756 INFO L93 Difference]: Finished difference Result 556 states and 559 transitions. [2019-08-05 11:06:58,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2019-08-05 11:06:58,757 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 509 [2019-08-05 11:06:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:58,760 INFO L225 Difference]: With dead ends: 556 [2019-08-05 11:06:58,760 INFO L226 Difference]: Without dead ends: 556 [2019-08-05 11:06:58,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 761 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41804 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=17502, Invalid=71600, Unknown=0, NotChecked=0, Total=89102 [2019-08-05 11:06:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-08-05 11:06:58,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2019-08-05 11:06:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-08-05 11:06:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 557 transitions. [2019-08-05 11:06:58,767 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 557 transitions. Word has length 509 [2019-08-05 11:06:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:58,767 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 557 transitions. [2019-08-05 11:06:58,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:06:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 557 transitions. [2019-08-05 11:06:58,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2019-08-05 11:06:58,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:58,771 INFO L399 BasicCegarLoop]: trace histogram [252, 251, 23, 22, 1, 1, 1] [2019-08-05 11:06:58,771 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:58,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:58,771 INFO L82 PathProgramCache]: Analyzing trace with hash -828059466, now seen corresponding path program 62 times [2019-08-05 11:06:58,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:59,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 5444 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:06:59,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 69280 backedges. 56289 proven. 9659 refuted. 0 times theorem prover too weak. 3332 trivial. 0 not checked. [2019-08-05 11:07:00,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:00,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:07:00,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:07:00,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:07:00,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:07:00,865 INFO L87 Difference]: Start difference. First operand 554 states and 557 transitions. Second operand 45 states. [2019-08-05 11:07:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:03,518 INFO L93 Difference]: Finished difference Result 554 states and 555 transitions. [2019-08-05 11:07:03,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:07:03,518 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 551 [2019-08-05 11:07:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:03,521 INFO L225 Difference]: With dead ends: 554 [2019-08-05 11:07:03,521 INFO L226 Difference]: Without dead ends: 554 [2019-08-05 11:07:03,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2397, Invalid=5085, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:07:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-08-05 11:07:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2019-08-05 11:07:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-08-05 11:07:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 555 transitions. [2019-08-05 11:07:03,526 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 555 transitions. Word has length 551 [2019-08-05 11:07:03,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:03,527 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 555 transitions. [2019-08-05 11:07:03,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:07:03,527 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 555 transitions. [2019-08-05 11:07:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2019-08-05 11:07:03,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:03,530 INFO L399 BasicCegarLoop]: trace histogram [253, 252, 23, 22, 1, 1, 1] [2019-08-05 11:07:03,530 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:03,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1359689296, now seen corresponding path program 63 times [2019-08-05 11:07:03,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:04,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 5462 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:07:04,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 69806 backedges. 55134 proven. 11361 refuted. 0 times theorem prover too weak. 3311 trivial. 0 not checked. [2019-08-05 11:07:05,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:05,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:07:05,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:07:05,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:07:05,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=1699, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:07:05,890 INFO L87 Difference]: Start difference. First operand 554 states and 555 transitions. Second operand 48 states. [2019-08-05 11:07:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:08,878 INFO L93 Difference]: Finished difference Result 557 states and 559 transitions. [2019-08-05 11:07:08,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:07:08,879 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 553 [2019-08-05 11:07:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:08,882 INFO L225 Difference]: With dead ends: 557 [2019-08-05 11:07:08,882 INFO L226 Difference]: Without dead ends: 557 [2019-08-05 11:07:08,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2647, Invalid=5725, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:07:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-08-05 11:07:08,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 556. [2019-08-05 11:07:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-08-05 11:07:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 558 transitions. [2019-08-05 11:07:08,887 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 558 transitions. Word has length 553 [2019-08-05 11:07:08,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:08,887 INFO L475 AbstractCegarLoop]: Abstraction has 556 states and 558 transitions. [2019-08-05 11:07:08,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:07:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 558 transitions. [2019-08-05 11:07:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2019-08-05 11:07:08,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:08,891 INFO L399 BasicCegarLoop]: trace histogram [254, 253, 23, 22, 1, 1, 1] [2019-08-05 11:07:08,891 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:08,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:08,891 INFO L82 PathProgramCache]: Analyzing trace with hash 991407786, now seen corresponding path program 64 times [2019-08-05 11:07:08,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:09,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 5480 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:07:09,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 70334 backedges. 737 proven. 66286 refuted. 0 times theorem prover too weak. 3311 trivial. 0 not checked. [2019-08-05 11:07:10,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:10,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:07:10,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:07:10,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:07:10,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:07:10,831 INFO L87 Difference]: Start difference. First operand 556 states and 558 transitions. Second operand 48 states. [2019-08-05 11:07:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:19,082 INFO L93 Difference]: Finished difference Result 604 states and 607 transitions. [2019-08-05 11:07:19,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 281 states. [2019-08-05 11:07:19,082 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 555 [2019-08-05 11:07:19,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:19,086 INFO L225 Difference]: With dead ends: 604 [2019-08-05 11:07:19,086 INFO L226 Difference]: Without dead ends: 604 [2019-08-05 11:07:19,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49753 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=20425, Invalid=84227, Unknown=0, NotChecked=0, Total=104652 [2019-08-05 11:07:19,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-08-05 11:07:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 602. [2019-08-05 11:07:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-08-05 11:07:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 605 transitions. [2019-08-05 11:07:19,097 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 605 transitions. Word has length 555 [2019-08-05 11:07:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:19,097 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 605 transitions. [2019-08-05 11:07:19,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:07:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 605 transitions. [2019-08-05 11:07:19,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-08-05 11:07:19,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:19,100 INFO L399 BasicCegarLoop]: trace histogram [275, 274, 24, 23, 1, 1, 1] [2019-08-05 11:07:19,100 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:19,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:19,101 INFO L82 PathProgramCache]: Analyzing trace with hash -452328047, now seen corresponding path program 65 times [2019-08-05 11:07:19,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:20,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 5898 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:07:20,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 82204 backedges. 67300 proven. 11087 refuted. 0 times theorem prover too weak. 3817 trivial. 0 not checked. [2019-08-05 11:07:21,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:21,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:07:21,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:07:21,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:07:21,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:07:21,414 INFO L87 Difference]: Start difference. First operand 602 states and 605 transitions. Second operand 47 states. [2019-08-05 11:07:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:23,593 INFO L93 Difference]: Finished difference Result 602 states and 603 transitions. [2019-08-05 11:07:23,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:07:23,594 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 599 [2019-08-05 11:07:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:23,597 INFO L225 Difference]: With dead ends: 602 [2019-08-05 11:07:23,597 INFO L226 Difference]: Without dead ends: 602 [2019-08-05 11:07:23,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2621, Invalid=5569, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:07:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-08-05 11:07:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-08-05 11:07:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-08-05 11:07:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 603 transitions. [2019-08-05 11:07:23,602 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 603 transitions. Word has length 599 [2019-08-05 11:07:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:23,603 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 603 transitions. [2019-08-05 11:07:23,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:07:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 603 transitions. [2019-08-05 11:07:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2019-08-05 11:07:23,606 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:23,606 INFO L399 BasicCegarLoop]: trace histogram [276, 275, 24, 23, 1, 1, 1] [2019-08-05 11:07:23,606 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:23,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:23,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1460277141, now seen corresponding path program 66 times [2019-08-05 11:07:23,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:25,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 5916 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:07:25,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 82777 backedges. 66035 proven. 12947 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2019-08-05 11:07:26,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:26,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:07:26,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:07:26,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:07:26,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=1845, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:07:26,491 INFO L87 Difference]: Start difference. First operand 602 states and 603 transitions. Second operand 50 states. [2019-08-05 11:07:29,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:29,724 INFO L93 Difference]: Finished difference Result 605 states and 607 transitions. [2019-08-05 11:07:29,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:07:29,725 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 601 [2019-08-05 11:07:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:29,728 INFO L225 Difference]: With dead ends: 605 [2019-08-05 11:07:29,728 INFO L226 Difference]: Without dead ends: 605 [2019-08-05 11:07:29,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2882, Invalid=6238, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:07:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-08-05 11:07:29,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 604. [2019-08-05 11:07:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-08-05 11:07:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 606 transitions. [2019-08-05 11:07:29,733 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 606 transitions. Word has length 601 [2019-08-05 11:07:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:29,734 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 606 transitions. [2019-08-05 11:07:29,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:07:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 606 transitions. [2019-08-05 11:07:29,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-08-05 11:07:29,737 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:29,737 INFO L399 BasicCegarLoop]: trace histogram [277, 276, 24, 23, 1, 1, 1] [2019-08-05 11:07:29,737 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:29,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:29,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1128025605, now seen corresponding path program 67 times [2019-08-05 11:07:29,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:31,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 5934 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:07:31,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 83352 backedges. 805 proven. 78752 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2019-08-05 11:07:32,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:32,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:07:32,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:07:32,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:07:32,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:07:32,197 INFO L87 Difference]: Start difference. First operand 604 states and 606 transitions. Second operand 50 states. [2019-08-05 11:07:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:41,321 INFO L93 Difference]: Finished difference Result 654 states and 657 transitions. [2019-08-05 11:07:41,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2019-08-05 11:07:41,322 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 603 [2019-08-05 11:07:41,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:41,325 INFO L225 Difference]: With dead ends: 654 [2019-08-05 11:07:41,325 INFO L226 Difference]: Without dead ends: 654 [2019-08-05 11:07:41,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58788 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=23699, Invalid=98451, Unknown=0, NotChecked=0, Total=122150 [2019-08-05 11:07:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-08-05 11:07:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2019-08-05 11:07:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-08-05 11:07:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 655 transitions. [2019-08-05 11:07:41,332 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 655 transitions. Word has length 603 [2019-08-05 11:07:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:41,333 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 655 transitions. [2019-08-05 11:07:41,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:07:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 655 transitions. [2019-08-05 11:07:41,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2019-08-05 11:07:41,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:41,336 INFO L399 BasicCegarLoop]: trace histogram [299, 298, 25, 24, 1, 1, 1] [2019-08-05 11:07:41,336 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:41,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:41,337 INFO L82 PathProgramCache]: Analyzing trace with hash -739137082, now seen corresponding path program 68 times [2019-08-05 11:07:41,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:42,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 6370 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:07:42,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 96854 backedges. 79858 proven. 12649 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2019-08-05 11:07:44,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:44,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:07:44,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:07:44,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:07:44,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:07:44,377 INFO L87 Difference]: Start difference. First operand 652 states and 655 transitions. Second operand 49 states. [2019-08-05 11:07:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:46,901 INFO L93 Difference]: Finished difference Result 652 states and 653 transitions. [2019-08-05 11:07:46,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:07:46,902 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 649 [2019-08-05 11:07:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:46,905 INFO L225 Difference]: With dead ends: 652 [2019-08-05 11:07:46,905 INFO L226 Difference]: Without dead ends: 652 [2019-08-05 11:07:46,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2855, Invalid=6075, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:07:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-08-05 11:07:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2019-08-05 11:07:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-08-05 11:07:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 653 transitions. [2019-08-05 11:07:46,910 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 653 transitions. Word has length 649 [2019-08-05 11:07:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:46,910 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 653 transitions. [2019-08-05 11:07:46,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:07:46,911 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 653 transitions. [2019-08-05 11:07:46,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2019-08-05 11:07:46,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:46,914 INFO L399 BasicCegarLoop]: trace histogram [300, 299, 25, 24, 1, 1, 1] [2019-08-05 11:07:46,914 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:46,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:46,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1072737120, now seen corresponding path program 69 times [2019-08-05 11:07:46,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:48,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 6388 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:07:48,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 97476 backedges. 78478 proven. 14674 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-08-05 11:07:49,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:49,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:07:49,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:07:49,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:07:49,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=655, Invalid=1997, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:07:49,981 INFO L87 Difference]: Start difference. First operand 652 states and 653 transitions. Second operand 52 states. [2019-08-05 11:07:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:52,816 INFO L93 Difference]: Finished difference Result 655 states and 657 transitions. [2019-08-05 11:07:52,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:07:52,817 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 651 [2019-08-05 11:07:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:52,821 INFO L225 Difference]: With dead ends: 655 [2019-08-05 11:07:52,821 INFO L226 Difference]: Without dead ends: 655 [2019-08-05 11:07:52,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3127, Invalid=6773, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:07:52,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-08-05 11:07:52,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 654. [2019-08-05 11:07:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-08-05 11:07:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 656 transitions. [2019-08-05 11:07:52,828 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 656 transitions. Word has length 651 [2019-08-05 11:07:52,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:52,828 INFO L475 AbstractCegarLoop]: Abstraction has 654 states and 656 transitions. [2019-08-05 11:07:52,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:07:52,829 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 656 transitions. [2019-08-05 11:07:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2019-08-05 11:07:52,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:52,833 INFO L399 BasicCegarLoop]: trace histogram [301, 300, 25, 24, 1, 1, 1] [2019-08-05 11:07:52,833 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:52,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:52,833 INFO L82 PathProgramCache]: Analyzing trace with hash 108273594, now seen corresponding path program 70 times [2019-08-05 11:07:52,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:54,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 6406 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:07:54,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 98100 backedges. 876 proven. 92900 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-08-05 11:07:55,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:55,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:07:55,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:07:55,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:07:55,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:07:55,517 INFO L87 Difference]: Start difference. First operand 654 states and 656 transitions. Second operand 52 states. [2019-08-05 11:08:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:05,483 INFO L93 Difference]: Finished difference Result 706 states and 709 transitions. [2019-08-05 11:08:05,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 330 states. [2019-08-05 11:08:05,483 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 653 [2019-08-05 11:08:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:05,487 INFO L225 Difference]: With dead ends: 706 [2019-08-05 11:08:05,487 INFO L226 Difference]: Without dead ends: 706 [2019-08-05 11:08:05,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69004 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=27351, Invalid=114401, Unknown=0, NotChecked=0, Total=141752 [2019-08-05 11:08:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-08-05 11:08:05,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 704. [2019-08-05 11:08:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-08-05 11:08:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 707 transitions. [2019-08-05 11:08:05,499 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 707 transitions. Word has length 653 [2019-08-05 11:08:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:05,500 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 707 transitions. [2019-08-05 11:08:05,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:08:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 707 transitions. [2019-08-05 11:08:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2019-08-05 11:08:05,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:05,503 INFO L399 BasicCegarLoop]: trace histogram [324, 323, 26, 25, 1, 1, 1] [2019-08-05 11:08:05,503 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:05,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:05,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2053820501, now seen corresponding path program 71 times [2019-08-05 11:08:05,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:07,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 6860 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:08:07,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 113377 backedges. 94102 proven. 14351 refuted. 0 times theorem prover too weak. 4924 trivial. 0 not checked. [2019-08-05 11:08:08,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:08,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:08:08,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:08:08,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:08:08,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1899, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:08:08,782 INFO L87 Difference]: Start difference. First operand 704 states and 707 transitions. Second operand 51 states. [2019-08-05 11:08:11,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:11,738 INFO L93 Difference]: Finished difference Result 704 states and 705 transitions. [2019-08-05 11:08:11,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:08:11,738 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 701 [2019-08-05 11:08:11,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:11,742 INFO L225 Difference]: With dead ends: 704 [2019-08-05 11:08:11,742 INFO L226 Difference]: Without dead ends: 704 [2019-08-05 11:08:11,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3099, Invalid=6603, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:08:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-08-05 11:08:11,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2019-08-05 11:08:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-08-05 11:08:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 705 transitions. [2019-08-05 11:08:11,747 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 705 transitions. Word has length 701 [2019-08-05 11:08:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:11,747 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 705 transitions. [2019-08-05 11:08:11,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:08:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 705 transitions. [2019-08-05 11:08:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2019-08-05 11:08:11,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:11,751 INFO L399 BasicCegarLoop]: trace histogram [325, 324, 26, 25, 1, 1, 1] [2019-08-05 11:08:11,751 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:11,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1030637009, now seen corresponding path program 72 times [2019-08-05 11:08:11,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:13,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 6878 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:08:13,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 114050 backedges. 92602 proven. 16548 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-08-05 11:08:15,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:15,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:08:15,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:08:15,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:08:15,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=2155, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:08:15,893 INFO L87 Difference]: Start difference. First operand 704 states and 705 transitions. Second operand 54 states. [2019-08-05 11:08:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:19,650 INFO L93 Difference]: Finished difference Result 707 states and 709 transitions. [2019-08-05 11:08:19,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:08:19,650 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 703 [2019-08-05 11:08:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:19,654 INFO L225 Difference]: With dead ends: 707 [2019-08-05 11:08:19,654 INFO L226 Difference]: Without dead ends: 707 [2019-08-05 11:08:19,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 650 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3382, Invalid=7330, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:08:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-08-05 11:08:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 706. [2019-08-05 11:08:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-08-05 11:08:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 708 transitions. [2019-08-05 11:08:19,660 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 708 transitions. Word has length 703 [2019-08-05 11:08:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:19,660 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 708 transitions. [2019-08-05 11:08:19,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:08:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 708 transitions. [2019-08-05 11:08:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2019-08-05 11:08:19,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:19,664 INFO L399 BasicCegarLoop]: trace histogram [326, 325, 26, 25, 1, 1, 1] [2019-08-05 11:08:19,664 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:19,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1695332041, now seen corresponding path program 73 times [2019-08-05 11:08:19,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:21,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 6896 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:08:21,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:08:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 114725 backedges. 950 proven. 108875 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-08-05 11:08:22,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:22,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:08:22,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:08:22,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:08:22,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:08:22,999 INFO L87 Difference]: Start difference. First operand 706 states and 708 transitions. Second operand 54 states. [2019-08-05 11:08:22,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-08-05 11:08:22,999 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:08:23,004 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:08:23,004 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:08:23 BoogieIcfgContainer [2019-08-05 11:08:23,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:08:23,005 INFO L168 Benchmark]: Toolchain (without parser) took 241462.54 ms. Allocated memory was 141.0 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 109.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 505.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:23,006 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 110.7 MB in the beginning and 110.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 11:08:23,006 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.06 ms. Allocated memory is still 141.0 MB. Free memory was 109.0 MB in the beginning and 107.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:23,007 INFO L168 Benchmark]: Boogie Preprocessor took 24.46 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 106.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:23,007 INFO L168 Benchmark]: RCFGBuilder took 451.53 ms. Allocated memory is still 141.0 MB. Free memory was 106.1 MB in the beginning and 93.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:23,008 INFO L168 Benchmark]: TraceAbstraction took 240943.88 ms. Allocated memory was 141.0 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 93.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 489.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:23,011 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 110.7 MB in the beginning and 110.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.06 ms. Allocated memory is still 141.0 MB. Free memory was 109.0 MB in the beginning and 107.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.46 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 106.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 451.53 ms. Allocated memory is still 141.0 MB. Free memory was 106.1 MB in the beginning and 93.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240943.88 ms. Allocated memory was 141.0 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 93.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 489.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 129). Cancelled while BasicCegarLoop was constructing difference of abstraction (706states) and FLOYD_HOARE automaton (currently 2 states, 54 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 240.8s OverallTime, 75 OverallIterations, 326 TraceHistogramMax, 149.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 1810 SDslu, 810 SDs, 0 SdLazy, 37093 SolverSat, 3446 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24149 GetRequests, 17956 SyntacticMatches, 0 SemanticMatches, 6193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407922 ImplicationChecksByTransitivity, 149.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=706occurred in iteration=74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 74 MinimizatonAttempts, 90 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 32.5s SatisfiabilityAnalysisTime, 57.7s InterpolantComputationTime, 19733 NumberOfCodeBlocks, 19733 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 19658 ConstructedInterpolants, 0 QuantifiedInterpolants, 39236708 SizeOfPredicates, 544 NumberOfNonLiveVariables, 199122 ConjunctsInSsa, 2478 ConjunctsInUnsatCore, 75 InterpolantComputations, 1 PerfectInterpolantSequences, 1128486/1952449 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown