java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/bhmr2007.c.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:18:11,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:18:11,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:18:11,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:18:11,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:18:11,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:18:11,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:18:11,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:18:11,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:18:11,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:18:11,487 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:18:11,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:18:11,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:18:11,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:18:11,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:18:11,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:18:11,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:18:11,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:18:11,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:18:11,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:18:11,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:18:11,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:18:11,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:18:11,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:18:11,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:18:11,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:18:11,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:18:11,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:18:11,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:18:11,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:18:11,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:18:11,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:18:11,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:18:11,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:18:11,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:18:11,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:18:11,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:18:11,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:18:11,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:18:11,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:18:11,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:18:11,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:18:11,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:18:11,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:18:11,569 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:18:11,569 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:18:11,570 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/bhmr2007.c.i_3.bpl [2019-08-05 10:18:11,571 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/bhmr2007.c.i_3.bpl' [2019-08-05 10:18:11,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:18:11,614 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:18:11,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:18:11,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:18:11,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:18:11,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:11" (1/1) ... [2019-08-05 10:18:11,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:11" (1/1) ... [2019-08-05 10:18:11,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:18:11,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:18:11,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:18:11,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:18:11,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:11" (1/1) ... [2019-08-05 10:18:11,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:11" (1/1) ... [2019-08-05 10:18:11,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:11" (1/1) ... [2019-08-05 10:18:11,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:11" (1/1) ... [2019-08-05 10:18:11,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:11" (1/1) ... [2019-08-05 10:18:11,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:11" (1/1) ... [2019-08-05 10:18:11,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:11" (1/1) ... [2019-08-05 10:18:11,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:18:11,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:18:11,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:18:11,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:18:11,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:18:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:18:11,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:18:11,950 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:18:11,950 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:18:11,952 INFO L202 PluginConnector]: Adding new model bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:18:11 BoogieIcfgContainer [2019-08-05 10:18:11,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:18:11,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:18:11,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:18:11,960 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:18:11,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:11" (1/2) ... [2019-08-05 10:18:11,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c849a9 and model type bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:18:11, skipping insertion in model container [2019-08-05 10:18:11,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:18:11" (2/2) ... [2019-08-05 10:18:11,963 INFO L109 eAbstractionObserver]: Analyzing ICFG bhmr2007.c.i_3.bpl [2019-08-05 10:18:11,971 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:18:11,977 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:18:11,990 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:18:12,015 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:18:12,016 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:18:12,016 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:18:12,017 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:18:12,017 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:18:12,017 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:18:12,017 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:18:12,017 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:18:12,018 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:18:12,031 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:18:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:18:12,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:12,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:18:12,042 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:12,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:12,048 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:18:12,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:12,140 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:18:12,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:12,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:18:12,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:18:12,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:18:12,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:18:12,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:18:12,345 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:18:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:12,376 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:18:12,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:18:12,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:18:12,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:12,389 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:18:12,389 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:18:12,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:18:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:18:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:18:12,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:18:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:18:12,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:18:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:12,421 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:18:12,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:18:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:18:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:18:12,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:12,423 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:18:12,423 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:12,424 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:18:12,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:12,446 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:18:12,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:12,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:12,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:12,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:18:12,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:18:12,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:18:12,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:18:12,562 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:18:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:12,602 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:18:12,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:18:12,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:18:12,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:12,603 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:18:12,603 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:18:12,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:18:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:18:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:18:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:18:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:18:12,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:18:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:12,607 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:18:12,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:18:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:18:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:18:12,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:12,608 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:18:12,608 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:12,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:12,609 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:18:12,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:12,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:18:12,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:12,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:12,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:18:12,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:18:12,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:18:12,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:18:12,776 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:18:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:12,836 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:18:12,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:18:12,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:18:12,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:12,837 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:18:12,838 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:18:12,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:18:12,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:18:12,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:18:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:18:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:18:12,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:18:12,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:12,841 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:18:12,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:18:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:18:12,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:18:12,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:12,842 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:18:12,842 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:12,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:12,843 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:18:12,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:12,910 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:18:12,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:13,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:13,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:18:13,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:18:13,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:18:13,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:18:13,232 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:18:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:13,282 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:18:13,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:18:13,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:18:13,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:13,283 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:18:13,283 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:18:13,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:18:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:18:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:18:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:18:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:18:13,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:18:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:13,286 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:18:13,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:18:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:18:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:18:13,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:13,287 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:18:13,287 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:13,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:13,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:18:13,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:13,314 WARN L254 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:18:13,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:13,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:13,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:18:13,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:18:13,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:18:13,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:18:13,629 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:18:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:13,686 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:18:13,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:18:13,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:18:13,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:13,688 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:18:13,688 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:18:13,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:18:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:18:13,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:18:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:18:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:18:13,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:18:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:13,691 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:18:13,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:18:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:18:13,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:18:13,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:13,692 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:18:13,692 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:13,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:13,693 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:18:13,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:13,721 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:18:13,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:13,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:13,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:18:13,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:18:13,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:18:13,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:18:13,955 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:18:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:14,030 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:18:14,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:18:14,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:18:14,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:14,037 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:18:14,037 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:18:14,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:18:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:18:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:18:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:18:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:18:14,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:18:14,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:14,041 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:18:14,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:18:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:18:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:18:14,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:14,042 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:18:14,042 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:14,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:14,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:18:14,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:14,071 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:18:14,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:14,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:14,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:18:14,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:18:14,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:18:14,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:18:14,467 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:18:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:14,576 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:18:14,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:18:14,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:18:14,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:14,577 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:18:14,577 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:18:14,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:18:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:18:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:18:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:18:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:18:14,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:18:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:14,580 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:18:14,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:18:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:18:14,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:18:14,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:14,581 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:18:14,581 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:14,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:14,582 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:18:14,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:14,613 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:18:14,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:14,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:14,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:18:14,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:18:14,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:18:14,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:18:14,878 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:18:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:14,961 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:18:14,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:18:14,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:18:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:14,962 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:18:14,963 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:18:14,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:18:14,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:18:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:18:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:18:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:18:14,972 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:18:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:14,972 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:18:14,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:18:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:18:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:18:14,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:14,973 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:18:14,973 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:14,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:14,974 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:18:14,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:15,014 WARN L254 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:18:15,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:15,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:15,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:18:15,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:18:15,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:18:15,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:18:15,358 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:18:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:15,478 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:18:15,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:18:15,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:18:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:15,484 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:18:15,484 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:18:15,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:18:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:18:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:18:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:18:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:18:15,487 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:18:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:15,487 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:18:15,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:18:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:18:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:18:15,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:15,488 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:18:15,488 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:15,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:18:15,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:15,518 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:18:15,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:15,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:15,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:18:15,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:18:15,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:18:15,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:18:15,753 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:18:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:15,883 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:18:15,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:18:15,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:18:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:15,885 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:18:15,885 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:18:15,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:18:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:18:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:18:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:18:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:18:15,888 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:18:15,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:15,889 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:18:15,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:18:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:18:15,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:18:15,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:15,890 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:18:15,890 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:15,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:15,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:18:15,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:15,921 WARN L254 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:18:15,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:16,190 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:18:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:16,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:16,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:18:16,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:18:16,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:18:16,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:18:16,706 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:18:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:16,881 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:18:16,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:18:16,889 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:18:16,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:16,889 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:18:16,889 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:18:16,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:18:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:18:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:18:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:18:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:18:16,894 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:18:16,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:16,894 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:18:16,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:18:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:18:16,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:18:16,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:16,895 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:18:16,895 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:16,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:16,896 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:18:16,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:16,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:18:16,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:17,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:17,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:18:17,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:18:17,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:18:17,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:18:17,199 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:18:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:17,349 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:18:17,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:18:17,349 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:18:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:17,350 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:18:17,351 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:18:17,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:18:17,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:18:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:18:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:18:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:18:17,353 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:18:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:17,354 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:18:17,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:18:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:18:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:18:17,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:17,355 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:18:17,355 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:17,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:17,355 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:18:17,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:17,380 WARN L254 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:18:17,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:17,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:17,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:18:17,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:18:17,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:18:17,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:18:17,747 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:18:18,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:18,035 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:18:18,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:18:18,040 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:18:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:18,041 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:18:18,041 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:18:18,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:18:18,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:18:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:18:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:18:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:18:18,047 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:18:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:18,047 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:18:18,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:18:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:18:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:18:18,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:18,048 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:18:18,048 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:18,049 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:18:18,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:18,095 WARN L254 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:18:18,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:18,383 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:18,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:18,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:18:18,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:18:18,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:18:18,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:18:18,385 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:18:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:18,660 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:18:18,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:18:18,660 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:18:18,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:18,661 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:18:18,661 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:18:18,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:18:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:18:18,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:18:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:18:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:18:18,665 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:18:18,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:18,672 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:18:18,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:18:18,673 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:18:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:18:18,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:18,673 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:18:18,674 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:18,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:18,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:18:18,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:18,696 WARN L254 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:18:18,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:19,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:19,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:18:19,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:18:19,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:18:19,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:18:19,125 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:18:19,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:19,337 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:18:19,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:18:19,337 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:18:19,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:19,338 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:18:19,338 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:18:19,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:18:19,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:18:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:18:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:18:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:18:19,343 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:18:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:19,343 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:18:19,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:18:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:18:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:18:19,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:19,344 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:18:19,344 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:19,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:18:19,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:19,368 WARN L254 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:18:19,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:19,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:19,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:18:19,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:18:19,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:18:19,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:18:19,811 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:18:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:20,097 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:18:20,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:18:20,097 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:18:20,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:20,098 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:18:20,099 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:18:20,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:18:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:18:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:18:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:18:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:18:20,103 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:18:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:20,103 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:18:20,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:18:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:18:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:18:20,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:20,104 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:18:20,105 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:20,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:20,105 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:18:20,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:20,139 WARN L254 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:18:20,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:20,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:20,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:18:20,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:18:20,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:18:20,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:18:20,464 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:18:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:20,757 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:18:20,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:18:20,758 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:18:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:20,758 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:18:20,759 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:18:20,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:18:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:18:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:18:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:18:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:18:20,762 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:18:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:20,762 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:18:20,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:18:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:18:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:18:20,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:20,764 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:18:20,764 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:20,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:20,764 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:18:20,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:20,788 WARN L254 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:18:20,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:21,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:21,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:18:21,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:18:21,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:18:21,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:18:21,141 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:18:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:21,502 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:18:21,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:18:21,504 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:18:21,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:21,504 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:18:21,505 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:18:21,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:18:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:18:21,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:18:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:18:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:18:21,509 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:18:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:21,509 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:18:21,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:18:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:18:21,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:18:21,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:21,510 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:18:21,511 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:21,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:21,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:18:21,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:21,543 WARN L254 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:18:21,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:23,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:23,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:18:23,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:18:23,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:18:23,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:18:23,173 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:18:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:23,511 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:18:23,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:18:23,512 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:18:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:23,513 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:18:23,513 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:18:23,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:18:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:18:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:18:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:18:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:18:23,517 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:18:23,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:23,518 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:18:23,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:18:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:18:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:18:23,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:23,519 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:18:23,519 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:23,519 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:18:23,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:23,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 10:18:23,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:23,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:23,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:18:23,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:18:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:18:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:18:23,981 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:18:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:24,380 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:18:24,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:18:24,381 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:18:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:24,382 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:18:24,382 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:18:24,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:18:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:18:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:18:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:18:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:18:24,386 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:18:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:24,386 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:18:24,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:18:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:18:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:18:24,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:24,387 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:18:24,388 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:24,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:24,388 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:18:24,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:24,417 WARN L254 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-05 10:18:24,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:24,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:24,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:18:24,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:18:24,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:18:24,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:18:24,825 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:18:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:25,275 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:18:25,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:18:25,275 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:18:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:25,276 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:18:25,277 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:18:25,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:18:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:18:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:18:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:18:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:18:25,281 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:18:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:25,281 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:18:25,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:18:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:18:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:18:25,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:25,282 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:18:25,283 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:25,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:18:25,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:25,311 WARN L254 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 10:18:25,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:25,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:25,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:18:25,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:18:25,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:18:25,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:18:25,811 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:18:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:26,246 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:18:26,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:18:26,248 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:18:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:26,249 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:18:26,249 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:18:26,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:18:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:18:26,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:18:26,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:18:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:18:26,254 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:18:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:26,254 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:18:26,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:18:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:18:26,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:18:26,255 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:26,255 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:18:26,255 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:26,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:26,256 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:18:26,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:26,298 WARN L254 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-05 10:18:26,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:28,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:28,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:18:28,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:18:28,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:18:28,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:18:28,362 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:18:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:29,167 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:18:29,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:18:29,168 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:18:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:29,169 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:18:29,169 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:18:29,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:18:29,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:18:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:18:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:18:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:18:29,173 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:18:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:29,173 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:18:29,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:18:29,173 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:18:29,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:18:29,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:29,174 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:18:29,174 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:29,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:29,175 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:18:29,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:29,207 WARN L254 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 10:18:29,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:29,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:29,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:18:29,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:18:29,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:18:29,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:18:29,797 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:18:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:30,485 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:18:30,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:18:30,486 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:18:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:30,486 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:18:30,487 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:18:30,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:18:30,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:18:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:18:30,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:18:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:18:30,492 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:18:30,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:30,492 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:18:30,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:18:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:18:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:18:30,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:30,493 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:18:30,493 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:30,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:18:30,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:30,524 WARN L254 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-05 10:18:30,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:31,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:31,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:18:31,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:18:31,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:18:31,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:18:31,042 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:18:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:31,561 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:18:31,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:18:31,561 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:18:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:31,562 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:18:31,562 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:18:31,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:18:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:18:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:18:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:18:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:18:31,566 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:18:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:31,566 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:18:31,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:18:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:18:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:18:31,567 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:31,567 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:18:31,568 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:31,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:31,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:18:31,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:31,600 WARN L254 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 10:18:31,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:32,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:32,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:18:32,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:18:32,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:18:32,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:18:32,125 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:18:32,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:32,693 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:18:32,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:18:32,694 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:18:32,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:32,695 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:18:32,695 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:18:32,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:18:32,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:18:32,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:18:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:18:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:18:32,698 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:18:32,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:32,699 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:18:32,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:18:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:18:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:18:32,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:32,699 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:18:32,700 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:32,700 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:18:32,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:32,735 WARN L254 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-05 10:18:32,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:33,642 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:33,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:33,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:18:33,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:18:33,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:18:33,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:18:33,643 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:18:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:34,242 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:18:34,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:18:34,243 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:18:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:34,243 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:18:34,244 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:18:34,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:18:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:18:34,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:18:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:18:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:18:34,247 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:18:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:34,247 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:18:34,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:18:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:18:34,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:18:34,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:34,248 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:18:34,249 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:34,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:34,249 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:18:34,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:34,286 WARN L254 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-05 10:18:34,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:35,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:35,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:18:35,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:18:35,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:18:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:18:35,007 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:18:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:35,642 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:18:35,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:18:35,643 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:18:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:35,644 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:18:35,644 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:18:35,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:18:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:18:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:18:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:18:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:18:35,648 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:18:35,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:35,649 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:18:35,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:18:35,649 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:18:35,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:18:35,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:35,650 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:18:35,650 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:35,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:35,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:18:35,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:35,687 WARN L254 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 179 conjunts are in the unsatisfiable core [2019-08-05 10:18:35,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:36,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:36,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:18:36,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:18:36,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:18:36,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:18:36,348 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:18:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:37,026 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:18:37,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:18:37,033 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:18:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:37,033 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:18:37,033 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:18:37,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:18:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:18:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:18:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:18:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:18:37,036 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:18:37,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:37,037 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:18:37,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:18:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:18:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:18:37,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:37,039 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:18:37,039 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:37,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:37,039 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:18:37,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:37,079 WARN L254 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 185 conjunts are in the unsatisfiable core [2019-08-05 10:18:37,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:37,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:37,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:18:37,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:18:37,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:18:37,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:18:37,784 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:18:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:38,736 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:18:38,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:18:38,736 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:18:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:38,737 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:18:38,737 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:18:38,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:18:38,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:18:38,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:18:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:18:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:18:38,741 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:18:38,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:38,741 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:18:38,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:18:38,741 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:18:38,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:18:38,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:38,742 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:18:38,742 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:38,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:38,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:18:38,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:38,783 WARN L254 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 191 conjunts are in the unsatisfiable core [2019-08-05 10:18:38,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:39,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:39,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:18:39,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:18:39,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:18:39,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:18:39,537 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:18:40,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:40,342 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:18:40,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:18:40,342 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:18:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:40,343 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:18:40,343 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:18:40,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:18:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:18:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:18:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:18:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:18:40,347 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:18:40,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:40,348 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:18:40,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:18:40,348 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:18:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:18:40,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:40,348 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:18:40,349 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:40,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:40,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:18:40,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:40,392 WARN L254 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-05 10:18:40,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:41,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:41,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:18:41,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:18:41,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:18:41,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:18:41,191 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:18:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:42,028 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:18:42,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:18:42,029 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:18:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:42,029 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:18:42,029 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:18:42,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:18:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:18:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:18:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:18:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:18:42,033 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:18:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:42,033 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:18:42,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:18:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:18:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:18:42,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:42,034 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:18:42,034 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:42,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:42,035 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:18:42,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:42,074 WARN L254 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 203 conjunts are in the unsatisfiable core [2019-08-05 10:18:42,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:42,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:42,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:18:42,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:18:42,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:18:42,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:18:42,932 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:18:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:43,977 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:18:43,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:18:43,978 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:18:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:43,978 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:18:43,978 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:18:43,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:18:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:18:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:18:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:18:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:18:43,982 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:18:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:43,982 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:18:43,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:18:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:18:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:18:43,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:43,983 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:18:43,983 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:43,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:43,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:18:43,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:44,031 WARN L254 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-05 10:18:44,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:45,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:45,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:18:45,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:18:45,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:18:45,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:18:45,412 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:18:46,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:46,337 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:18:46,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:18:46,338 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:18:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:46,339 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:18:46,339 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:18:46,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:18:46,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:18:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:18:46,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:18:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:18:46,342 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:18:46,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:46,342 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:18:46,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:18:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:18:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:18:46,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:46,343 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:18:46,343 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:18:46,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:46,388 WARN L254 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 215 conjunts are in the unsatisfiable core [2019-08-05 10:18:46,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:47,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:47,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:18:47,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:18:47,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:18:47,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:18:47,167 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:18:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:48,148 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:18:48,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:18:48,149 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:18:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:48,150 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:18:48,150 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:18:48,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:18:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:18:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:18:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:18:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:18:48,154 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:18:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:48,154 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:18:48,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:18:48,154 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:18:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:18:48,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:48,155 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:18:48,155 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:48,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:48,155 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:18:48,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:48,207 WARN L254 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 221 conjunts are in the unsatisfiable core [2019-08-05 10:18:48,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:49,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:49,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:18:49,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:18:49,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:18:49,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:18:49,190 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:18:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:50,254 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:18:50,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:18:50,255 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:18:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:50,256 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:18:50,256 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:18:50,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:18:50,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:18:50,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:18:50,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:18:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:18:50,260 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:18:50,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:50,260 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:18:50,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:18:50,260 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:18:50,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:18:50,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:50,261 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:18:50,261 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:50,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:50,261 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:18:50,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:50,311 WARN L254 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 227 conjunts are in the unsatisfiable core [2019-08-05 10:18:50,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:51,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:51,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:18:51,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:18:51,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:18:51,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:18:51,171 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:18:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:52,273 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:18:52,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:18:52,274 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:18:52,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:52,275 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:18:52,275 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:18:52,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:18:52,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:18:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:18:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:18:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:18:52,277 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:18:52,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:52,278 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:18:52,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:18:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:18:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:18:52,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:52,278 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:18:52,279 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:52,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:52,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:18:52,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:52,338 WARN L254 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 233 conjunts are in the unsatisfiable core [2019-08-05 10:18:52,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:52,613 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:18:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:53,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:53,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:18:53,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:18:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:18:53,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:18:53,919 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:18:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:55,084 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:18:55,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:18:55,084 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:18:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:55,085 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:18:55,085 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:18:55,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:18:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:18:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:18:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:18:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:18:55,088 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:18:55,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:55,088 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:18:55,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:18:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:18:55,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:18:55,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:55,089 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:18:55,089 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:55,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:55,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:18:55,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:55,141 WARN L254 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 239 conjunts are in the unsatisfiable core [2019-08-05 10:18:55,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:56,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:56,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:18:56,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:18:56,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:18:56,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:18:56,026 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:18:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:57,243 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:18:57,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:18:57,243 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:18:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:57,244 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:18:57,244 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:18:57,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:18:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:18:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:18:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:18:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:18:57,248 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:18:57,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:57,248 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:18:57,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:18:57,248 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:18:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:18:57,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:57,249 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:18:57,249 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:57,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:57,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:18:57,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:57,323 WARN L254 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 245 conjunts are in the unsatisfiable core [2019-08-05 10:18:57,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:57,602 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:18:57,974 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:18:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:59,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:59,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:18:59,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:18:59,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:18:59,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:18:59,188 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:19:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:00,475 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:19:00,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:19:00,475 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:19:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:00,476 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:19:00,476 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:19:00,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:19:00,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:19:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:19:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:19:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:19:00,480 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:19:00,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:00,480 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:19:00,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:19:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:19:00,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:19:00,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:00,481 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:19:00,481 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:00,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:00,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:19:00,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:00,543 WARN L254 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 251 conjunts are in the unsatisfiable core [2019-08-05 10:19:00,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:01,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:01,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:19:01,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:19:01,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:19:01,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:19:01,550 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:19:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:02,912 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:19:02,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:19:02,912 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:19:02,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:02,913 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:19:02,913 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:19:02,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:19:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:19:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:19:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:19:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:19:02,916 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:19:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:02,916 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:19:02,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:19:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:19:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:19:02,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:02,917 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:19:02,917 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:02,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:02,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:19:02,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:02,986 WARN L254 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 257 conjunts are in the unsatisfiable core [2019-08-05 10:19:02,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:04,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:04,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:19:04,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:19:04,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:19:04,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:19:04,432 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:19:05,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:05,853 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:19:05,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:19:05,853 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:19:05,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:05,854 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:19:05,854 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:19:05,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:19:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:19:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:19:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:19:05,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:19:05,857 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:19:05,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:05,857 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:19:05,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:19:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:19:05,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:19:05,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:05,858 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:19:05,858 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:05,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:05,858 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:19:05,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:05,933 WARN L254 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 263 conjunts are in the unsatisfiable core [2019-08-05 10:19:05,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:07,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:07,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:19:07,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:19:07,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:19:07,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:19:07,023 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:19:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:08,523 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:19:08,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:19:08,523 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:19:08,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:08,524 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:19:08,524 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:19:08,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:19:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:19:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:19:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:19:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:19:08,528 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:19:08,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:08,528 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:19:08,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:19:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:19:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:19:08,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:08,529 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:19:08,529 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:08,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:08,529 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:19:08,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:08,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 269 conjunts are in the unsatisfiable core [2019-08-05 10:19:08,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:10,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:10,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:19:10,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:19:10,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:19:10,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:19:10,046 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:19:11,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:11,579 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:19:11,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:19:11,579 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:19:11,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:11,580 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:19:11,580 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:19:11,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:19:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:19:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:19:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:19:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:19:11,583 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:19:11,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:11,584 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:19:11,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:19:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:19:11,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:19:11,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:11,585 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:19:11,585 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:11,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:11,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:19:11,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:11,665 WARN L254 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 275 conjunts are in the unsatisfiable core [2019-08-05 10:19:11,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:12,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:12,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:19:12,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:19:12,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:19:12,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:19:12,833 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:19:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:14,578 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:19:14,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:19:14,578 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:19:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:14,579 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:19:14,579 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:19:14,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:19:14,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:19:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:19:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:19:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:19:14,582 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:19:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:14,583 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:19:14,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:19:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:19:14,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:19:14,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:14,583 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:19:14,584 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:14,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:19:14,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:14,667 WARN L254 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 281 conjunts are in the unsatisfiable core [2019-08-05 10:19:14,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:16,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:16,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:19:16,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:19:16,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:19:16,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:19:16,066 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:19:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:17,749 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:19:17,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:19:17,750 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:19:17,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:17,750 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:19:17,750 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:19:17,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:19:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:19:17,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:19:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:19:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:19:17,753 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:19:17,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:17,753 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:19:17,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:19:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:19:17,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:19:17,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:17,754 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:19:17,754 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:17,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:17,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:19:17,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:17,855 WARN L254 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 287 conjunts are in the unsatisfiable core [2019-08-05 10:19:17,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:19,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:19,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:19:19,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:19:19,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:19:19,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:19:19,280 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:19:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:21,093 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:19:21,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:19:21,094 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:19:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:21,095 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:19:21,095 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:19:21,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:19:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:19:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:19:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:19:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:19:21,097 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:19:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:21,098 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:19:21,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:19:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:19:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:19:21,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:21,099 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:19:21,099 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:21,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:21,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:19:21,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:21,161 WARN L254 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 293 conjunts are in the unsatisfiable core [2019-08-05 10:19:21,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:22,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:22,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:19:22,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:19:22,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:19:22,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:19:22,872 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:19:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:24,848 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:19:24,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:19:24,848 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:19:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:24,849 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:19:24,849 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:19:24,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:19:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:19:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:19:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:19:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:19:24,852 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:19:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:24,853 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:19:24,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:19:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:19:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:19:24,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:24,854 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:19:24,854 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:24,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:24,854 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:19:24,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:24,948 WARN L254 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 299 conjunts are in the unsatisfiable core [2019-08-05 10:19:24,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:26,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:26,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:19:26,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:19:26,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:19:26,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:19:26,298 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:19:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:28,210 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:19:28,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:19:28,211 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:19:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:28,212 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:19:28,212 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:19:28,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:19:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:19:28,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:19:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:19:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:19:28,215 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:19:28,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:28,216 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:19:28,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:19:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:19:28,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:19:28,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:28,216 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:19:28,217 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:28,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:28,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:19:28,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:28,289 WARN L254 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 305 conjunts are in the unsatisfiable core [2019-08-05 10:19:28,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:30,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:30,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:19:30,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:19:30,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:19:30,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:19:30,006 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:19:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:31,994 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:19:31,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:19:31,995 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:19:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:31,996 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:19:31,996 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:19:31,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:19:31,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:19:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:19:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:19:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:19:31,999 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:19:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:31,999 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:19:31,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:19:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:19:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:19:32,000 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:32,000 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:19:32,000 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:32,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:32,000 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:19:32,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:32,096 WARN L254 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 311 conjunts are in the unsatisfiable core [2019-08-05 10:19:32,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:33,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:33,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:19:33,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:19:33,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:19:33,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:19:33,583 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:19:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:35,826 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:19:35,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:19:35,827 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:19:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:35,828 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:19:35,828 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:19:35,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:19:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:19:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:19:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:19:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:19:35,830 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:19:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:35,830 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:19:35,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:19:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:19:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:19:35,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:35,831 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:19:35,831 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:35,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:35,832 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:19:35,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:35,942 WARN L254 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 317 conjunts are in the unsatisfiable core [2019-08-05 10:19:35,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:37,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:37,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:19:37,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:19:37,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:19:37,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:19:37,444 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:19:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:39,719 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:19:39,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:19:39,719 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:19:39,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:39,720 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:19:39,720 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:19:39,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:19:39,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:19:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:19:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:19:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:19:39,722 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:19:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:39,722 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:19:39,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:19:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:19:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:19:39,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:39,723 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:19:39,723 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:39,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:39,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:19:39,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:39,799 WARN L254 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 323 conjunts are in the unsatisfiable core [2019-08-05 10:19:39,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:41,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:41,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:19:41,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:19:41,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:19:41,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:19:41,513 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:19:43,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:43,728 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:19:43,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:19:43,728 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:19:43,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:43,729 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:19:43,730 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:19:43,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:19:43,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:19:43,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:19:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:19:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:19:43,733 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:19:43,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:43,734 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:19:43,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:19:43,734 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:19:43,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:19:43,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:43,734 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:19:43,735 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:43,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:43,735 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:19:43,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:43,840 WARN L254 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 329 conjunts are in the unsatisfiable core [2019-08-05 10:19:43,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:45,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:45,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:19:45,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:19:45,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:19:45,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:19:45,727 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:19:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:48,056 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:19:48,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:19:48,057 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:19:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:48,058 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:19:48,058 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:19:48,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:19:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:19:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:19:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:19:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:19:48,060 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:19:48,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:48,061 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:19:48,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:19:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:19:48,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:19:48,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:48,061 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:19:48,062 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:48,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:48,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:19:48,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:48,142 WARN L254 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 335 conjunts are in the unsatisfiable core [2019-08-05 10:19:48,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:49,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:49,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:19:49,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:19:49,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:19:49,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:19:49,726 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:19:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:52,289 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:19:52,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:19:52,291 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:19:52,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:52,292 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:19:52,292 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:19:52,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:19:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:19:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:19:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:19:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:19:52,294 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:19:52,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:52,294 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:19:52,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:19:52,294 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:19:52,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:19:52,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:52,294 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:19:52,295 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:52,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:52,295 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:19:52,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:52,379 WARN L254 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 341 conjunts are in the unsatisfiable core [2019-08-05 10:19:52,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:54,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:54,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:19:54,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:19:54,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:19:54,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:19:54,070 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:19:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:56,699 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:19:56,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:19:56,699 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:19:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:56,700 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:19:56,700 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:19:56,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:19:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:19:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:19:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:19:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:19:56,703 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:19:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:56,704 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:19:56,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:19:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:19:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:19:56,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:56,705 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:19:56,705 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:56,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:56,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:19:56,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:56,796 WARN L254 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 347 conjunts are in the unsatisfiable core [2019-08-05 10:19:56,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:58,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:58,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:19:58,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:19:58,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:19:58,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:19:58,591 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:20:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:01,330 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:20:01,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:20:01,331 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:20:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:01,332 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:20:01,332 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:20:01,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:20:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:20:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:20:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:20:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:20:01,335 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:20:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:01,335 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:20:01,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:20:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:20:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:20:01,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:01,336 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:20:01,336 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:01,336 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:20:01,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:01,458 WARN L254 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 353 conjunts are in the unsatisfiable core [2019-08-05 10:20:01,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:03,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:03,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:20:03,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:20:03,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:20:03,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:20:03,309 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:20:06,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:06,067 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:20:06,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:20:06,068 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:20:06,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:06,069 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:20:06,069 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:20:06,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:20:06,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:20:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:20:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:20:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:20:06,072 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:20:06,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:06,072 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:20:06,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:20:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:20:06,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:20:06,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:06,073 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:20:06,073 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:06,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:06,073 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:20:06,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:06,185 WARN L254 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 359 conjunts are in the unsatisfiable core [2019-08-05 10:20:06,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:08,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:08,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:20:08,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:20:08,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:20:08,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:20:08,228 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:20:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:11,136 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:20:11,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:20:11,137 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:20:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:11,138 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:20:11,138 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:20:11,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:20:11,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:20:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:20:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:20:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:20:11,140 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:20:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:11,140 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:20:11,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:20:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:20:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:20:11,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:11,141 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:20:11,141 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:11,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:11,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:20:11,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:11,338 WARN L254 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 365 conjunts are in the unsatisfiable core [2019-08-05 10:20:11,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:13,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:13,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:20:13,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:20:13,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:20:13,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:20:13,554 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:20:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:16,497 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:20:16,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:20:16,498 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:20:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:16,499 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:20:16,499 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:20:16,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:20:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:20:16,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:20:16,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:20:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:20:16,502 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:20:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:16,502 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:20:16,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:20:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:20:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:20:16,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:16,503 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:20:16,503 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:16,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:16,503 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:20:16,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:16,617 WARN L254 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 371 conjunts are in the unsatisfiable core [2019-08-05 10:20:16,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:18,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:18,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:20:18,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:20:18,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:20:18,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:20:18,536 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:20:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:21,629 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:20:21,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:20:21,630 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:20:21,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:21,630 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:20:21,630 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:20:21,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:20:21,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:20:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:20:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:20:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:20:21,633 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:20:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:21,633 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:20:21,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:20:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:20:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:20:21,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:21,634 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:20:21,634 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:21,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:21,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:20:21,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:21,748 WARN L254 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 377 conjunts are in the unsatisfiable core [2019-08-05 10:20:21,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:23,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:23,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:20:23,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:20:23,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:20:23,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:20:23,788 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:20:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:27,004 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:20:27,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:20:27,004 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:20:27,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:27,005 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:20:27,005 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:20:27,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:20:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:20:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:20:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:20:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:20:27,014 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:20:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:27,014 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:20:27,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:20:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:20:27,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:20:27,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:27,014 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:20:27,015 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:27,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:27,015 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:20:27,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:27,136 WARN L254 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 383 conjunts are in the unsatisfiable core [2019-08-05 10:20:27,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:29,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:29,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:20:29,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:20:29,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:20:29,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:20:29,658 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:20:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:32,934 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:20:32,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:20:32,934 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:20:32,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:32,935 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:20:32,935 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:20:32,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:20:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:20:32,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:20:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:20:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:20:32,938 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:20:32,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:32,938 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:20:32,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:20:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:20:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:20:32,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:32,939 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:20:32,939 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:32,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:32,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:20:32,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:33,096 WARN L254 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 389 conjunts are in the unsatisfiable core [2019-08-05 10:20:33,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:35,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:35,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:35,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:20:35,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:20:35,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:20:35,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:20:35,342 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:20:38,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:38,719 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:20:38,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:20:38,720 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:20:38,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:38,720 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:20:38,721 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:20:38,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:20:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:20:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:20:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:20:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:20:38,724 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:20:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:38,724 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:20:38,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:20:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:20:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:20:38,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:38,725 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:20:38,725 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:38,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:38,726 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:20:38,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:38,850 WARN L254 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 395 conjunts are in the unsatisfiable core [2019-08-05 10:20:38,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:41,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:41,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:20:41,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:20:41,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:20:41,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:20:41,375 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:20:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:44,709 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:20:44,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:20:44,710 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:20:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:44,711 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:20:44,711 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:20:44,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:20:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:20:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:20:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:20:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:20:44,714 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:20:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:44,714 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:20:44,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:20:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:20:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:20:44,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:44,715 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:20:44,715 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:44,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:44,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:20:44,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:44,934 WARN L254 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 401 conjunts are in the unsatisfiable core [2019-08-05 10:20:44,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:47,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:47,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:20:47,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:20:47,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:20:47,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:20:47,531 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:20:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:50,952 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:20:50,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:20:50,952 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:20:50,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:50,953 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:20:50,953 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:20:50,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:20:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:20:50,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:20:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:20:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:20:50,956 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:20:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:50,956 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:20:50,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:20:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:20:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:20:50,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:50,957 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:20:50,957 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:50,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:50,958 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:20:50,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:51,115 WARN L254 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 407 conjunts are in the unsatisfiable core [2019-08-05 10:20:51,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:53,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:53,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:20:53,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:20:53,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:20:53,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:20:53,424 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:20:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:57,077 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:20:57,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:20:57,078 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:20:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:57,079 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:20:57,079 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:20:57,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:20:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:20:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:20:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:20:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:20:57,082 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:20:57,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:57,082 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:20:57,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:20:57,083 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:20:57,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:20:57,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:57,083 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:20:57,083 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:57,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:57,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:20:57,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:57,292 WARN L254 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 413 conjunts are in the unsatisfiable core [2019-08-05 10:20:57,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:59,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:59,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:20:59,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:20:59,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:20:59,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:20:59,621 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:21:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:03,385 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:21:03,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:21:03,386 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:21:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:03,387 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:21:03,387 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:21:03,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:21:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:21:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:21:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:21:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:21:03,390 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:21:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:03,390 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:21:03,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:21:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:21:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:21:03,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:03,391 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:21:03,391 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:03,392 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:21:03,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:03,562 WARN L254 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 419 conjunts are in the unsatisfiable core [2019-08-05 10:21:03,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:06,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:06,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:21:06,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:21:06,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:21:06,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:21:06,001 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:21:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:09,838 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:21:09,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:21:09,838 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:21:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:09,839 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:21:09,839 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:21:09,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:21:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:21:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:21:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:21:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:21:09,842 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:21:09,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:09,843 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:21:09,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:21:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:21:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:21:09,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:09,843 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:21:09,844 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:09,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:09,844 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:21:09,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:10,019 WARN L254 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 425 conjunts are in the unsatisfiable core [2019-08-05 10:21:10,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:12,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:12,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:21:12,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:21:12,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:21:12,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:21:12,709 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:21:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:16,562 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:21:16,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:21:16,563 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:21:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:16,564 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:21:16,564 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:21:16,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:21:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:21:16,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:21:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:21:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:21:16,567 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:21:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:16,567 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:21:16,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:21:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:21:16,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:21:16,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:16,568 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:21:16,568 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:16,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:16,569 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:21:16,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:16,827 WARN L254 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 431 conjunts are in the unsatisfiable core [2019-08-05 10:21:16,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:19,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:19,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:21:19,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:21:19,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:21:19,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:21:19,498 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:21:23,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:23,557 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:21:23,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:21:23,557 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:21:23,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:23,558 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:21:23,558 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:21:23,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:21:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:21:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:21:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:21:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:21:23,561 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:21:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:23,562 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:21:23,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:21:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:21:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:21:23,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:23,563 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:21:23,563 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:23,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:23,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:21:23,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:23,871 WARN L254 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 437 conjunts are in the unsatisfiable core [2019-08-05 10:21:23,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:26,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:26,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:21:26,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:21:26,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:21:26,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:21:26,602 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:21:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:31,290 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:21:31,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:21:31,290 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:21:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:31,291 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:21:31,291 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:21:31,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:21:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:21:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:21:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:21:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:21:31,295 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:21:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:31,295 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:21:31,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:21:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:21:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:21:31,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:31,296 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:21:31,296 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:31,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:31,296 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:21:31,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:31,491 WARN L254 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 443 conjunts are in the unsatisfiable core [2019-08-05 10:21:31,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:34,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:34,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:21:34,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:21:34,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:21:34,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:21:34,311 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:21:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:38,622 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:21:38,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:21:38,623 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:21:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:38,624 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:21:38,624 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:21:38,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:21:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:21:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:21:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:21:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:21:38,627 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:21:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:38,627 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:21:38,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:21:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:21:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:21:38,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:38,628 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:21:38,628 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:38,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:21:38,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:38,801 WARN L254 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 449 conjunts are in the unsatisfiable core [2019-08-05 10:21:38,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:41,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:41,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:21:41,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:21:41,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:21:41,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:21:41,493 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:21:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:45,956 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:21:45,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:21:45,957 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:21:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:45,958 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:21:45,958 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:21:45,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:21:45,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:21:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:21:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:21:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:21:45,962 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:21:45,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:45,962 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:21:45,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:21:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:21:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:21:45,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:45,963 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:21:45,964 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:45,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:21:45,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:46,281 WARN L254 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 455 conjunts are in the unsatisfiable core [2019-08-05 10:21:46,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:49,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:49,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:21:49,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:21:49,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:21:49,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:21:49,480 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:21:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:54,009 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:21:54,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:21:54,009 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:21:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:54,010 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:21:54,010 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:21:54,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:21:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:21:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:21:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:21:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:21:54,013 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:21:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:54,013 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:21:54,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:21:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:21:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:21:54,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:54,014 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:21:54,014 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:21:54,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:54,200 WARN L254 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 461 conjunts are in the unsatisfiable core [2019-08-05 10:21:54,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:57,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:57,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:21:57,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:21:57,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:21:57,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:21:57,083 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:22:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:01,807 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:22:01,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:22:01,807 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:22:01,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:01,808 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:22:01,808 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:22:01,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:22:01,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:22:01,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:22:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:22:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:22:01,811 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:22:01,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:01,811 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:22:01,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:22:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:22:01,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:22:01,812 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:01,813 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:22:01,813 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:01,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:01,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:22:01,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:02,011 WARN L254 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 467 conjunts are in the unsatisfiable core [2019-08-05 10:22:02,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:05,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:05,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:22:05,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:22:05,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:22:05,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:22:05,201 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:22:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:10,122 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:22:10,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:22:10,123 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:22:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:10,124 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:22:10,124 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:22:10,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:22:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:22:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:22:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:22:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:22:10,127 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:22:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:10,127 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:22:10,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:22:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:22:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:22:10,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:10,127 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:22:10,128 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:10,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:10,128 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:22:10,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:10,329 WARN L254 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 473 conjunts are in the unsatisfiable core [2019-08-05 10:22:10,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:13,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:13,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:22:13,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:22:13,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:22:13,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:22:13,726 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:22:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:18,890 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:22:18,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:22:18,891 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:22:18,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:18,892 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:22:18,892 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:22:18,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:22:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:22:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:22:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:22:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:22:18,894 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:22:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:18,895 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:22:18,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:22:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:22:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:22:18,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:18,895 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:22:18,896 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:18,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:18,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:22:18,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:19,154 WARN L254 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 479 conjunts are in the unsatisfiable core [2019-08-05 10:22:19,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:22,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:22,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:22:22,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:22:22,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:22:22,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:22:22,229 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. Received shutdown request... [2019-08-05 10:22:23,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:22:23,400 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:22:23,407 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:22:23,407 INFO L202 PluginConnector]: Adding new model bhmr2007.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:22:23 BoogieIcfgContainer [2019-08-05 10:22:23,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:22:23,409 INFO L168 Benchmark]: Toolchain (without parser) took 251794.74 ms. Allocated memory was 133.7 MB in the beginning and 334.0 MB in the end (delta: 200.3 MB). Free memory was 111.1 MB in the beginning and 121.0 MB in the end (delta: -9.8 MB). Peak memory consumption was 190.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:23,410 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.74 ms. Allocated memory is still 133.7 MB. Free memory was 112.4 MB in the beginning and 112.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:22:23,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.37 ms. Allocated memory is still 133.7 MB. Free memory was 110.9 MB in the beginning and 109.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:23,411 INFO L168 Benchmark]: Boogie Preprocessor took 24.86 ms. Allocated memory is still 133.7 MB. Free memory was 109.4 MB in the beginning and 108.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:23,411 INFO L168 Benchmark]: RCFGBuilder took 272.25 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 98.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:23,412 INFO L168 Benchmark]: TraceAbstraction took 251451.78 ms. Allocated memory was 133.7 MB in the beginning and 334.0 MB in the end (delta: 200.3 MB). Free memory was 98.4 MB in the beginning and 121.0 MB in the end (delta: -22.6 MB). Peak memory consumption was 177.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:23,415 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.74 ms. Allocated memory is still 133.7 MB. Free memory was 112.4 MB in the beginning and 112.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.37 ms. Allocated memory is still 133.7 MB. Free memory was 110.9 MB in the beginning and 109.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.86 ms. Allocated memory is still 133.7 MB. Free memory was 109.4 MB in the beginning and 108.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 272.25 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 98.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251451.78 ms. Allocated memory was 133.7 MB in the beginning and 334.0 MB in the end (delta: 200.3 MB). Free memory was 98.4 MB in the beginning and 121.0 MB in the end (delta: -22.6 MB). Peak memory consumption was 177.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 50). Cancelled while BasicCegarLoop was constructing difference of abstraction (82states) and FLOYD_HOARE automaton (currently 21 states, 81 states before enhancement),while ReachableStatesComputation was computing reachable states (19 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 251.3s OverallTime, 79 OverallIterations, 78 TraceHistogramMax, 135.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 235 SDtfs, 0 SDslu, 3081 SDs, 0 SdLazy, 168901 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 114.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3239 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 105.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=78, 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, 78 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 111.5s InterpolantComputationTime, 3318 NumberOfCodeBlocks, 3318 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 3239 ConstructedInterpolants, 0 QuantifiedInterpolants, 1719356 SizeOfPredicates, 474 NumberOfNonLiveVariables, 32548 ConjunctsInSsa, 19355 ConjunctsInUnsatCore, 79 InterpolantComputations, 1 PerfectInterpolantSequences, 0/82160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown