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/gr2006.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:21:18,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:21:18,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:21:18,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:21:18,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:21:18,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:21:18,408 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:21:18,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:21:18,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:21:18,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:21:18,413 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:21:18,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:21:18,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:21:18,415 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:21:18,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:21:18,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:21:18,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:21:18,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:21:18,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:21:18,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:21:18,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:21:18,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:21:18,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:21:18,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:21:18,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:21:18,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:21:18,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:21:18,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:21:18,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:21:18,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:21:18,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:21:18,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:21:18,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:21:18,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:21:18,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:21:18,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:21:18,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:21:18,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:21:18,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:21:18,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:21:18,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:21:18,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:21:18,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:21:18,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:21:18,483 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:21:18,484 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:21:18,485 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gr2006.c.i_4.bpl [2019-08-05 10:21:18,485 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gr2006.c.i_4.bpl' [2019-08-05 10:21:18,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:21:18,524 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:21:18,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:18,525 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:21:18,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:21:18,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:18" (1/1) ... [2019-08-05 10:21:18,554 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:18" (1/1) ... [2019-08-05 10:21:18,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:18,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:21:18,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:21:18,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:21:18,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:18" (1/1) ... [2019-08-05 10:21:18,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:18" (1/1) ... [2019-08-05 10:21:18,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:18" (1/1) ... [2019-08-05 10:21:18,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:18" (1/1) ... [2019-08-05 10:21:18,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:18" (1/1) ... [2019-08-05 10:21:18,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:18" (1/1) ... [2019-08-05 10:21:18,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:18" (1/1) ... [2019-08-05 10:21:18,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:21:18,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:21:18,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:21:18,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:21:18,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:18" (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:21:18,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:21:18,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:21:18,945 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:21:18,945 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:21:18,946 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:18 BoogieIcfgContainer [2019-08-05 10:21:18,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:21:18,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:21:18,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:21:18,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:21:18,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:18" (1/2) ... [2019-08-05 10:21:18,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db1abf2 and model type gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:21:18, skipping insertion in model container [2019-08-05 10:21:18,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:18" (2/2) ... [2019-08-05 10:21:18,955 INFO L109 eAbstractionObserver]: Analyzing ICFG gr2006.c.i_4.bpl [2019-08-05 10:21:18,965 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:21:18,974 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:21:18,991 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:21:19,021 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:21:19,022 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:21:19,022 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:21:19,022 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:21:19,022 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:21:19,022 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:21:19,023 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:21:19,023 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:21:19,023 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:21:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:21:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:21:19,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:19,046 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:21:19,049 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:19,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:19,055 INFO L82 PathProgramCache]: Analyzing trace with hash 944090, now seen corresponding path program 1 times [2019-08-05 10:21:19,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:19,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:21:19,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:19,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:19,315 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:21:19,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:19,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:19,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:21:19,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:21:19,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:19,354 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 10:21:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:19,557 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:21:19,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:21:19,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:21:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:19,573 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:21:19,573 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:21:19,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:21:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 10:21:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:21:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:21:19,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 10:21:19,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:19,610 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:21:19,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:21:19,611 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:21:19,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:21:19,612 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:19,612 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:21:19,612 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:19,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:19,613 INFO L82 PathProgramCache]: Analyzing trace with hash 907335265, now seen corresponding path program 1 times [2019-08-05 10:21:19,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:19,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:21:19,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:19,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:19,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:19,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:21:19,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:21:19,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:21:19,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:19,733 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 10:21:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:19,927 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:21:19,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:21:19,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:21:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:19,939 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:21:19,939 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:21:19,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:21:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:21:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:21:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:21:19,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 10:21:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:19,943 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:21:19,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:21:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:21:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:21:19,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:19,950 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 10:21:19,950 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:19,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:19,951 INFO L82 PathProgramCache]: Analyzing trace with hash 70893352, now seen corresponding path program 2 times [2019-08-05 10:21:19,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:19,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:21:19,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:20,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:20,185 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:21:20,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:20,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:21:20,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:21:20,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:21:20,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:20,187 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-08-05 10:21:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:20,455 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:21:20,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:21:20,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:21:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:20,457 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:21:20,457 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:21:20,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:21:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 10:21:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:21:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:21:20,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:21:20,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:20,463 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:21:20,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:21:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:21:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:21:20,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:20,465 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 10:21:20,466 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:20,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:20,466 INFO L82 PathProgramCache]: Analyzing trace with hash -590900689, now seen corresponding path program 3 times [2019-08-05 10:21:20,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:20,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:21:20,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:20,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:20,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:20,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:21:20,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:21:20,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:21:20,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:20,615 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2019-08-05 10:21:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:20,843 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:21:20,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:21:20,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:21:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:20,844 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:21:20,845 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:21:20,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:21:20,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:21:20,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:21:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:21:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:21:20,849 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:21:20,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:20,849 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:21:20,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:21:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:21:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:21:20,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:20,850 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 10:21:20,851 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:20,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash -919814282, now seen corresponding path program 4 times [2019-08-05 10:21:20,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:20,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:21:20,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:21,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:21,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:21,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:21:21,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:21:21,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:21:21,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:21,223 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-08-05 10:21:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:21,411 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:21:21,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:21:21,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:21:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:21,415 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:21:21,415 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:21:21,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:21:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:21:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 10:21:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:21:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:21:21,418 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 10:21:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:21,419 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:21:21,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:21:21,419 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:21:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:21:21,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:21,420 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 10:21:21,420 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:21,420 INFO L82 PathProgramCache]: Analyzing trace with hash 821802749, now seen corresponding path program 5 times [2019-08-05 10:21:21,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:21,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:21:21,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:21,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:21,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:21,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:21:21,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:21:21,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:21:21,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:21,574 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2019-08-05 10:21:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:21,837 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:21:21,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:21:21,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-08-05 10:21:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:21,839 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:21:21,839 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:21:21,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:21:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:21:21,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 10:21:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:21:21,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:21:21,843 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 10:21:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:21,843 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:21:21,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:21:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:21:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:21:21,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:21,845 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 10:21:21,845 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:21,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:21,845 INFO L82 PathProgramCache]: Analyzing trace with hash -521475900, now seen corresponding path program 6 times [2019-08-05 10:21:21,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:21,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:21:21,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:22,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:22,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:22,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:21:22,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:21:22,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:21:22,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:22,086 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-08-05 10:21:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:22,326 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:21:22,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:21:22,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:21:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:22,328 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:21:22,328 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:21:22,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:21:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:21:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 10:21:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:21:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:21:22,333 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 10:21:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:22,333 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:21:22,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:21:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:21:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:21:22,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:22,334 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 10:21:22,334 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:22,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:22,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1372898507, now seen corresponding path program 7 times [2019-08-05 10:21:22,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:22,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:21:22,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:22,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:22,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:22,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:21:22,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:21:22,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:21:22,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:22,470 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2019-08-05 10:21:22,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:22,677 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:21:22,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:21:22,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-08-05 10:21:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:22,679 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:21:22,680 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:21:22,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:21:22,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:21:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 10:21:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:21:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:21:22,684 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 10:21:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:22,684 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:21:22,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:21:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:21:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:21:22,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:22,685 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 10:21:22,685 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:22,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:22,686 INFO L82 PathProgramCache]: Analyzing trace with hash 800570130, now seen corresponding path program 8 times [2019-08-05 10:21:22,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:22,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:21:22,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:22,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:22,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:22,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:21:22,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:21:22,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:21:22,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:21:22,828 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-08-05 10:21:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:23,097 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:21:23,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:21:23,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-08-05 10:21:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:23,099 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:21:23,099 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:21:23,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=293, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:21:23,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:21:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 10:21:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:21:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:21:23,104 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 10:21:23,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:23,105 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:21:23,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:21:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:21:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:21:23,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:23,106 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 10:21:23,106 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:23,107 INFO L82 PathProgramCache]: Analyzing trace with hash 548813721, now seen corresponding path program 9 times [2019-08-05 10:21:23,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:23,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:21:23,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:23,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:23,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:23,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:21:23,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:21:23,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:21:23,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:21:23,378 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2019-08-05 10:21:23,560 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 6 [2019-08-05 10:21:23,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:23,726 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:21:23,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:21:23,727 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-08-05 10:21:23,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:23,728 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:21:23,728 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:21:23,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=350, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:21:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:21:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 10:21:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:21:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:21:23,732 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 10:21:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:23,732 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:21:23,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:21:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:21:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:21:23,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:23,733 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 10:21:23,733 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:23,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:23,734 INFO L82 PathProgramCache]: Analyzing trace with hash -870926752, now seen corresponding path program 10 times [2019-08-05 10:21:23,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:23,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:21:23,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:23,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:23,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:23,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:21:23,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:21:23,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:21:23,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:21:23,916 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-08-05 10:21:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:24,454 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:21:24,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:21:24,455 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-08-05 10:21:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:24,456 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:21:24,456 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:21:24,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:21:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:21:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 10:21:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:21:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:21:24,461 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 10:21:24,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:24,461 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:21:24,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:21:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:21:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:21:24,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:24,462 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 10:21:24,462 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:24,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash 558078823, now seen corresponding path program 11 times [2019-08-05 10:21:24,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:24,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:21:24,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:24,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:24,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:24,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:21:24,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:21:24,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:21:24,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:21:24,791 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2019-08-05 10:21:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:25,058 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:21:25,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:21:25,059 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-08-05 10:21:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:25,060 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:21:25,060 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:21:25,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=277, Invalid=479, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:21:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:21:25,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 10:21:25,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:21:25,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:21:25,064 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 10:21:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:25,065 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:21:25,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:21:25,065 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:21:25,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:21:25,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:25,066 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 10:21:25,066 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:25,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:25,067 INFO L82 PathProgramCache]: Analyzing trace with hash -557098322, now seen corresponding path program 12 times [2019-08-05 10:21:25,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:25,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:21:25,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:25,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:25,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:25,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:21:25,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:21:25,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:21:25,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:21:25,259 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-08-05 10:21:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:25,657 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:21:25,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:21:25,657 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-08-05 10:21:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:25,658 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:21:25,658 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:21:25,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:21:25,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:21:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-08-05 10:21:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:21:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:21:25,662 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 10:21:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:25,662 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:21:25,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:21:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:21:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:21:25,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:25,663 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 10:21:25,664 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:25,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:25,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1499489333, now seen corresponding path program 13 times [2019-08-05 10:21:25,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:25,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:21:25,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:26,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:26,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:26,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:21:26,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:21:26,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:21:26,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:21:26,038 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2019-08-05 10:21:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:26,343 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:21:26,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:21:26,343 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-08-05 10:21:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:26,344 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:21:26,344 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:21:26,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=364, Invalid=628, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:21:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:21:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 10:21:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:21:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:21:26,349 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 10:21:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:26,349 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:21:26,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:21:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:21:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:21:26,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:26,350 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 10:21:26,351 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:26,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:26,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2099697668, now seen corresponding path program 14 times [2019-08-05 10:21:26,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:26,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:21:26,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:26,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:26,621 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:21:26,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:26,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:21:26,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:21:26,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:21:26,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:21:26,622 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-08-05 10:21:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:26,997 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:21:26,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:21:27,000 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-08-05 10:21:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:27,001 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:21:27,001 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:21:27,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=412, Invalid=710, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:21:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:21:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-08-05 10:21:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:21:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:21:27,007 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 10:21:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:27,007 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:21:27,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:21:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:21:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:21:27,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:27,011 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 10:21:27,011 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:27,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:27,012 INFO L82 PathProgramCache]: Analyzing trace with hash 825234947, now seen corresponding path program 15 times [2019-08-05 10:21:27,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:27,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:21:27,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:27,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:27,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:27,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:21:27,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:21:27,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:21:27,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:21:27,511 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 19 states. [2019-08-05 10:21:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:27,959 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:21:27,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:21:27,961 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-08-05 10:21:27,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:27,961 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:21:27,961 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:21:27,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=463, Invalid=797, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:21:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:21:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 10:21:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:21:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:21:27,965 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 10:21:27,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:27,965 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:21:27,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:21:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:21:27,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:21:27,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:27,966 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 10:21:27,966 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:27,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:27,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1518100918, now seen corresponding path program 16 times [2019-08-05 10:21:27,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:27,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:21:27,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:28,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:28,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:28,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:21:28,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:21:28,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:21:28,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:21:28,161 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-08-05 10:21:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:28,601 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:21:28,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:21:28,602 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-08-05 10:21:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:28,603 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:21:28,603 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:21:28,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=517, Invalid=889, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:21:28,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:21:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-08-05 10:21:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:21:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:21:28,608 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 10:21:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:28,609 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:21:28,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:21:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:21:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:21:28,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:28,610 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 10:21:28,610 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:28,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:28,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1393963217, now seen corresponding path program 17 times [2019-08-05 10:21:28,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:28,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:21:28,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:28,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:28,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:28,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:21:28,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:21:28,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:21:28,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:21:28,880 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2019-08-05 10:21:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:29,310 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:21:29,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:21:29,311 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-08-05 10:21:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:29,312 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:21:29,312 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:21:29,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=574, Invalid=986, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:21:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:21:29,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 10:21:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:21:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:21:29,317 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 10:21:29,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:29,317 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:21:29,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:21:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:21:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:21:29,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:29,318 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 10:21:29,319 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:29,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:29,319 INFO L82 PathProgramCache]: Analyzing trace with hash -431080040, now seen corresponding path program 18 times [2019-08-05 10:21:29,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:29,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:21:29,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:29,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:29,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:29,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:21:29,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:21:29,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:21:29,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:21:29,605 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-08-05 10:21:30,165 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-08-05 10:21:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:30,410 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:21:30,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:21:30,410 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-08-05 10:21:30,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:30,411 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:21:30,411 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:21:30,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=634, Invalid=1088, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:21:30,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:21:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-08-05 10:21:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:21:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:21:30,415 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 10:21:30,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:30,416 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:21:30,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:21:30,416 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:21:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:21:30,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:30,417 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 10:21:30,417 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:30,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:30,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1950993249, now seen corresponding path program 19 times [2019-08-05 10:21:30,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:30,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:21:30,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:30,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:30,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:30,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:21:30,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:21:30,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:21:30,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:21:30,666 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 23 states. [2019-08-05 10:21:31,028 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-08-05 10:21:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:31,276 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:21:31,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:21:31,276 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-08-05 10:21:31,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:31,277 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:21:31,277 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:21:31,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=697, Invalid=1195, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:21:31,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:21:31,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 10:21:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:21:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:21:31,283 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 10:21:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:31,283 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:21:31,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:21:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:21:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:21:31,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:31,284 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 10:21:31,284 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:31,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:31,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1996260838, now seen corresponding path program 20 times [2019-08-05 10:21:31,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:31,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:21:31,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:31,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:31,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:31,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:21:31,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:21:31,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:21:31,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:21:31,703 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-08-05 10:21:32,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:32,559 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:21:32,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:21:32,559 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-08-05 10:21:32,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:32,560 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:21:32,560 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:21:32,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=763, Invalid=1307, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:21:32,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:21:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-08-05 10:21:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:21:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:21:32,564 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 10:21:32,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:32,565 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:21:32,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:21:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:21:32,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:21:32,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:32,566 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 10:21:32,566 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:32,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:32,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1443651219, now seen corresponding path program 21 times [2019-08-05 10:21:32,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:32,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:21:32,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:33,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:33,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:33,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:21:33,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:21:33,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:21:33,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:21:33,121 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 25 states. [2019-08-05 10:21:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:33,654 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:21:33,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:21:33,658 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-08-05 10:21:33,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:33,659 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:21:33,659 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:21:33,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=832, Invalid=1424, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:21:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:21:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 10:21:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:21:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:21:33,663 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 10:21:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:33,664 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:21:33,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:21:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:21:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:21:33,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:33,665 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 10:21:33,665 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:33,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:33,665 INFO L82 PathProgramCache]: Analyzing trace with hash -74320076, now seen corresponding path program 22 times [2019-08-05 10:21:33,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:33,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:21:33,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:34,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:34,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:34,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:21:34,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:21:34,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:21:34,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:21:34,085 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-08-05 10:21:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:34,660 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:21:34,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:21:34,660 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-08-05 10:21:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:34,661 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:21:34,662 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:21:34,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=904, Invalid=1546, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:21:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:21:34,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 10:21:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:21:34,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:21:34,666 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 10:21:34,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:34,667 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:21:34,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:21:34,667 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:21:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:21:34,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:34,668 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 10:21:34,668 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:34,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:34,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1592915771, now seen corresponding path program 23 times [2019-08-05 10:21:34,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:34,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:21:34,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:35,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:35,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:35,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:21:35,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:21:35,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:21:35,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:21:35,042 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 27 states. [2019-08-05 10:21:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:35,661 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:21:35,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:21:35,662 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-08-05 10:21:35,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:35,663 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:21:35,663 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:21:35,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=979, Invalid=1673, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:21:35,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:21:35,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 10:21:35,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:21:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:21:35,668 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 10:21:35,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:35,668 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:21:35,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:21:35,669 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:21:35,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:21:35,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:35,669 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 10:21:35,670 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:35,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:35,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1783763330, now seen corresponding path program 24 times [2019-08-05 10:21:35,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:35,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:21:35,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:36,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:36,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:36,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:21:36,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:21:36,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:21:36,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:21:36,076 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-08-05 10:21:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:36,784 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:21:36,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:21:36,785 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-08-05 10:21:36,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:36,786 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:21:36,786 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:21:36,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1057, Invalid=1805, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:21:36,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:21:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-05 10:21:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:21:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:21:36,791 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 10:21:36,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:36,792 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:21:36,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:21:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:21:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:21:36,792 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:36,793 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 10:21:36,793 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash 504673801, now seen corresponding path program 25 times [2019-08-05 10:21:36,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:36,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:21:36,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:38,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:38,208 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:38,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:38,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:21:38,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:21:38,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:21:38,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:21:38,210 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 29 states. [2019-08-05 10:21:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:38,973 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:21:38,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:21:38,974 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2019-08-05 10:21:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:38,975 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:21:38,975 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:21:38,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1138, Invalid=1942, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:21:38,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:21:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 10:21:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:21:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:21:38,979 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 10:21:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:38,979 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:21:38,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:21:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:21:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:21:38,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:38,980 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 10:21:38,980 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash -339716912, now seen corresponding path program 26 times [2019-08-05 10:21:38,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:38,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:21:38,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:39,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:39,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:39,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:21:39,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:21:39,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:21:39,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=488, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:21:39,744 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-08-05 10:21:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:40,419 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:21:40,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:21:40,419 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-08-05 10:21:40,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:40,420 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:21:40,420 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:21:40,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1222, Invalid=2084, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:21:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:21:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-08-05 10:21:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:21:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:21:40,424 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 10:21:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:40,424 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:21:40,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:21:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:21:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:21:40,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:40,425 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 10:21:40,425 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:40,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:40,425 INFO L82 PathProgramCache]: Analyzing trace with hash -50373161, now seen corresponding path program 27 times [2019-08-05 10:21:40,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:40,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:21:40,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:40,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:40,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:40,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:21:40,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:21:40,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:21:40,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=520, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:21:40,839 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 31 states. [2019-08-05 10:21:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:41,840 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:21:41,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:21:41,841 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-08-05 10:21:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:41,842 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:21:41,842 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:21:41,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1309, Invalid=2231, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:21:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:21:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 10:21:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:21:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:21:41,847 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 10:21:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:41,847 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:21:41,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:21:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:21:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:21:41,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:41,848 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 10:21:41,848 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:41,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:41,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1163902690, now seen corresponding path program 28 times [2019-08-05 10:21:41,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:41,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:21:41,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:42,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:42,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:42,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:21:42,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:21:42,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:21:42,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=553, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:21:42,227 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-08-05 10:21:43,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:43,298 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:21:43,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:21:43,299 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-08-05 10:21:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:43,299 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:21:43,299 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:21:43,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1399, Invalid=2383, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:21:43,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:21:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-08-05 10:21:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:21:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:21:43,303 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 10:21:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:43,304 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:21:43,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:21:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:21:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:21:43,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:43,305 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 10:21:43,305 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:43,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:43,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1818923355, now seen corresponding path program 29 times [2019-08-05 10:21:43,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:43,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:21:43,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:43,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:44,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:44,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:21:44,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:21:44,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:21:44,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=587, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:21:44,286 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 33 states. [2019-08-05 10:21:44,551 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-08-05 10:21:44,787 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2019-08-05 10:21:45,038 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 6 [2019-08-05 10:21:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:45,847 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:21:45,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:21:45,847 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2019-08-05 10:21:45,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:45,848 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:21:45,848 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:21:45,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1492, Invalid=2540, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:21:45,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:21:45,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 10:21:45,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:21:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:21:45,850 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 10:21:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:45,851 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:21:45,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:21:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:21:45,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:21:45,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:45,851 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 10:21:45,851 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:45,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:45,852 INFO L82 PathProgramCache]: Analyzing trace with hash 66410092, now seen corresponding path program 30 times [2019-08-05 10:21:45,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:45,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:21:45,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:46,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:46,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:46,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:21:46,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:21:46,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:21:46,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=622, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:21:46,284 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-08-05 10:21:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:47,212 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:21:47,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:21:47,213 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-08-05 10:21:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:47,214 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:21:47,214 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:21:47,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1588, Invalid=2702, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:21:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:21:47,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-08-05 10:21:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:21:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:21:47,218 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 10:21:47,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:47,219 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:21:47,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:21:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:21:47,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:21:47,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:47,219 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 10:21:47,220 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:47,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:47,220 INFO L82 PathProgramCache]: Analyzing trace with hash -604346253, now seen corresponding path program 31 times [2019-08-05 10:21:47,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:47,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:21:47,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:47,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:47,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:47,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:21:47,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:21:47,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:21:47,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=658, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:21:47,968 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 35 states. [2019-08-05 10:21:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:48,895 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:21:48,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:21:48,896 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2019-08-05 10:21:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:48,897 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:21:48,897 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:21:48,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1687, Invalid=2869, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:21:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:21:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 10:21:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:21:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:21:48,901 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 10:21:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:48,901 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:21:48,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:21:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:21:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:21:48,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:48,902 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 10:21:48,902 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:48,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:48,902 INFO L82 PathProgramCache]: Analyzing trace with hash -956099398, now seen corresponding path program 32 times [2019-08-05 10:21:48,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:48,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:21:48,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:49,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:49,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:49,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:21:49,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:21:49,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:21:49,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=695, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:21:49,399 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-08-05 10:21:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:50,376 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:21:50,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:21:50,377 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-08-05 10:21:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:50,378 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:21:50,378 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:21:50,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1789, Invalid=3041, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:21:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:21:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 10:21:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:21:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:21:50,382 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 10:21:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:50,382 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:21:50,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:21:50,383 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:21:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:21:50,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:50,383 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 10:21:50,383 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:50,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:50,384 INFO L82 PathProgramCache]: Analyzing trace with hash 311544641, now seen corresponding path program 33 times [2019-08-05 10:21:50,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:50,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:21:50,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:50,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:50,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:50,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:21:50,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:21:50,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:21:50,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=733, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:21:50,878 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 37 states. [2019-08-05 10:21:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:51,928 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:21:51,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:21:51,928 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-08-05 10:21:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:51,929 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:21:51,929 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:21:51,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1894, Invalid=3218, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:21:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:21:51,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 10:21:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:21:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:21:51,932 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 10:21:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:51,932 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:21:51,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:21:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:21:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:21:51,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:51,934 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 10:21:51,934 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:51,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:51,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1253245944, now seen corresponding path program 34 times [2019-08-05 10:21:51,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:51,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:21:51,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:52,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:52,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:52,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:21:52,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:21:52,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:21:52,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=772, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:21:52,508 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-08-05 10:21:53,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:53,813 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:21:53,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:21:53,813 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-08-05 10:21:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:53,814 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:21:53,815 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:21:53,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2002, Invalid=3400, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:21:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:21:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 10:21:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:21:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:21:53,818 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 10:21:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:53,818 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:21:53,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:21:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:21:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:21:53,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:53,819 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 10:21:53,819 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:53,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:53,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1778444529, now seen corresponding path program 35 times [2019-08-05 10:21:53,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:53,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:21:53,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:55,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:55,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:55,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:21:55,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:21:55,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:21:55,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=812, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:21:55,102 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 39 states. [2019-08-05 10:21:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:56,142 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:21:56,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:21:56,143 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2019-08-05 10:21:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:56,144 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:21:56,144 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:21:56,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2113, Invalid=3587, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:21:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:21:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 10:21:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:21:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:21:56,147 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 10:21:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:56,148 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:21:56,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:21:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:21:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:21:56,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:56,148 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 10:21:56,148 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:56,149 INFO L82 PathProgramCache]: Analyzing trace with hash 311856214, now seen corresponding path program 36 times [2019-08-05 10:21:56,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:56,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:21:56,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:56,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:56,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:56,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:21:56,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:21:56,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:21:56,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=853, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:21:56,768 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-08-05 10:21:58,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:58,235 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:21:58,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:21:58,235 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-08-05 10:21:58,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:58,236 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:21:58,236 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:21:58,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2227, Invalid=3779, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:21:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:21:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 10:21:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:21:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:21:58,240 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 10:21:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:58,240 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:21:58,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:21:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:21:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:21:58,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:58,241 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 10:21:58,242 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:58,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:58,242 INFO L82 PathProgramCache]: Analyzing trace with hash -953824291, now seen corresponding path program 37 times [2019-08-05 10:21:58,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:58,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:21:58,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:58,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:58,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:58,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:21:58,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:21:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:21:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=745, Invalid=895, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:21:58,910 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 41 states. [2019-08-05 10:22:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:00,099 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:22:00,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:22:00,099 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2019-08-05 10:22:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:00,100 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:22:00,101 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:22:00,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2344, Invalid=3976, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:22:00,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:22:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 10:22:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:22:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:22:00,104 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 10:22:00,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:00,104 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:22:00,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:22:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:22:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:22:00,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:00,105 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 10:22:00,105 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:00,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:00,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1797044828, now seen corresponding path program 38 times [2019-08-05 10:22:00,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:00,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:22:00,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:00,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:00,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:00,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:22:00,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:22:00,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:22:00,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=784, Invalid=938, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:22:00,830 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-08-05 10:22:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:02,096 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:22:02,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:22:02,097 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-08-05 10:22:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:02,098 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:22:02,098 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:22:02,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2464, Invalid=4178, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:22:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:22:02,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-08-05 10:22:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:22:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:22:02,101 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 10:22:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:02,102 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:22:02,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:22:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:22:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:22:02,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:02,102 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 10:22:02,102 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:02,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:02,103 INFO L82 PathProgramCache]: Analyzing trace with hash -383161941, now seen corresponding path program 39 times [2019-08-05 10:22:02,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:02,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:22:02,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:02,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:02,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:02,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:22:02,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:22:02,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:22:02,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=824, Invalid=982, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:22:02,734 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2019-08-05 10:22:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:04,213 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:22:04,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:22:04,213 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2019-08-05 10:22:04,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:04,214 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:22:04,214 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:22:04,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2587, Invalid=4385, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:22:04,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:22:04,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 10:22:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:22:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:22:04,218 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 10:22:04,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:04,219 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:22:04,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:22:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:22:04,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:22:04,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:04,220 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 10:22:04,220 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:04,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:04,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1148626930, now seen corresponding path program 40 times [2019-08-05 10:22:04,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:04,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:22:04,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:04,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:05,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:05,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:22:05,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:22:05,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:22:05,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=1027, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:22:05,017 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-08-05 10:22:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:06,274 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:22:06,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:22:06,275 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-08-05 10:22:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:06,276 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:22:06,276 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:22:06,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2713, Invalid=4597, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:22:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:22:06,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 10:22:06,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:22:06,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:22:06,279 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 10:22:06,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:06,280 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:22:06,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:22:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:22:06,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:22:06,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:06,281 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 10:22:06,281 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:06,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:06,281 INFO L82 PathProgramCache]: Analyzing trace with hash 23949433, now seen corresponding path program 41 times [2019-08-05 10:22:06,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:06,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:22:06,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:07,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:07,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:07,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:22:07,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:22:07,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:22:07,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=1073, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:22:07,097 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 45 states. [2019-08-05 10:22:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:08,802 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:22:08,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:22:08,802 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2019-08-05 10:22:08,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:08,803 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:22:08,804 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:22:08,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2842, Invalid=4814, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:22:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:22:08,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 10:22:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:22:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:22:08,807 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 10:22:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:08,807 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:22:08,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:22:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:22:08,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:22:08,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:08,807 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 10:22:08,808 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:08,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:08,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1540633408, now seen corresponding path program 42 times [2019-08-05 10:22:08,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:08,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:22:08,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:09,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:09,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:09,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:22:09,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:22:09,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:22:09,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=950, Invalid=1120, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:22:09,588 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-08-05 10:22:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:11,049 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:22:11,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:22:11,049 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-08-05 10:22:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:11,050 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:22:11,050 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:22:11,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2974, Invalid=5036, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:22:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:22:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-08-05 10:22:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:22:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:22:11,054 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-05 10:22:11,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:11,054 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:22:11,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:22:11,054 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:22:11,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:22:11,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:11,055 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-05 10:22:11,055 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:11,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:11,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1214947257, now seen corresponding path program 43 times [2019-08-05 10:22:11,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:11,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:22:11,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:12,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:12,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:12,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:22:12,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:22:12,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:22:12,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=1168, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:22:12,030 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 47 states. [2019-08-05 10:22:12,278 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 6 [2019-08-05 10:22:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:13,869 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:22:13,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:22:13,870 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2019-08-05 10:22:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:13,871 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:22:13,871 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:22:13,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3109, Invalid=5263, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:22:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:22:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 10:22:13,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:22:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:22:13,874 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-05 10:22:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:13,875 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:22:13,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:22:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:22:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:22:13,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:13,876 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-05 10:22:13,876 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:13,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:13,876 INFO L82 PathProgramCache]: Analyzing trace with hash 666855310, now seen corresponding path program 44 times [2019-08-05 10:22:13,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:13,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:22:13,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:14,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:14,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:14,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:22:14,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:22:14,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:22:14,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1039, Invalid=1217, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:22:14,959 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-08-05 10:22:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:16,441 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:22:16,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:22:16,442 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-08-05 10:22:16,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:16,443 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:22:16,443 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:22:16,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3247, Invalid=5495, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:22:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:22:16,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-08-05 10:22:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:22:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:22:16,445 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-05 10:22:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:16,445 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:22:16,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:22:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:22:16,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:22:16,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:16,446 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-05 10:22:16,446 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:16,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:16,446 INFO L82 PathProgramCache]: Analyzing trace with hash 897890581, now seen corresponding path program 45 times [2019-08-05 10:22:16,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:16,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:22:16,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:17,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:17,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:17,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:22:17,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:22:17,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:22:17,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=1267, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:22:17,448 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 49 states. [2019-08-05 10:22:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:19,315 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:22:19,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:22:19,315 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2019-08-05 10:22:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:19,316 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:22:19,316 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:22:19,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3388, Invalid=5732, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:22:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:22:19,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 10:22:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:22:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:22:19,320 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-05 10:22:19,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:19,320 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:22:19,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:22:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:22:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:22:19,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:19,321 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-05 10:22:19,321 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:19,321 INFO L82 PathProgramCache]: Analyzing trace with hash -415513380, now seen corresponding path program 46 times [2019-08-05 10:22:19,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:19,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:22:19,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:20,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:20,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:20,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:22:20,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:22:20,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:22:20,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=1318, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:22:20,257 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-08-05 10:22:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:21,970 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:22:21,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:22:21,971 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-08-05 10:22:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:21,972 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:22:21,972 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:22:21,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3532, Invalid=5974, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:22:21,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:22:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-08-05 10:22:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:22:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:22:21,975 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-05 10:22:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:21,975 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:22:21,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:22:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:22:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:22:21,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:21,976 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-05 10:22:21,976 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:21,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:21,976 INFO L82 PathProgramCache]: Analyzing trace with hash 123665123, now seen corresponding path program 47 times [2019-08-05 10:22:21,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:21,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:22:21,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:22,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:22,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:22,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:22:22,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:22:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:22:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1180, Invalid=1370, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:22:22,882 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 51 states. [2019-08-05 10:22:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:24,810 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:22:24,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:22:24,811 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2019-08-05 10:22:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:24,812 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:22:24,812 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:22:24,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3679, Invalid=6221, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:22:24,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:22:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 10:22:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:22:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:22:24,816 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-05 10:22:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:24,816 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:22:24,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:22:24,817 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:22:24,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:22:24,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:24,817 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-05 10:22:24,817 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:24,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:24,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1416836310, now seen corresponding path program 48 times [2019-08-05 10:22:24,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:24,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:22:24,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:26,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:26,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:26,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:26,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:22:26,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:22:26,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:22:26,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=1423, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:22:26,194 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-08-05 10:22:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:28,101 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:22:28,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:22:28,102 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-08-05 10:22:28,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:28,103 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:22:28,103 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:22:28,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3829, Invalid=6473, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:22:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:22:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-08-05 10:22:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:22:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:22:28,107 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-05 10:22:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:28,107 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:22:28,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:22:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:22:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:22:28,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:28,108 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-05 10:22:28,108 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:28,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:28,109 INFO L82 PathProgramCache]: Analyzing trace with hash -74996303, now seen corresponding path program 49 times [2019-08-05 10:22:28,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:28,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:22:28,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:29,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:29,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:29,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:22:29,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:22:29,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:22:29,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=1477, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:22:29,404 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 53 states. [2019-08-05 10:22:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:31,269 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:22:31,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:22:31,269 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2019-08-05 10:22:31,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:31,270 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:22:31,270 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:22:31,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3982, Invalid=6730, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:22:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:22:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 10:22:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:22:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:22:31,276 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-05 10:22:31,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:31,277 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:22:31,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:22:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:22:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:22:31,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:31,277 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-05 10:22:31,278 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:31,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:31,278 INFO L82 PathProgramCache]: Analyzing trace with hash 943061624, now seen corresponding path program 50 times [2019-08-05 10:22:31,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:31,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:22:31,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:32,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:32,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:32,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:32,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:22:32,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:22:32,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:22:32,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1283, Invalid=1579, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:22:32,742 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-08-05 10:22:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:35,067 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:22:35,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:22:35,068 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-08-05 10:22:35,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:35,069 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:22:35,071 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:22:35,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4037, Invalid=6883, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:22:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:22:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:22:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:22:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:22:35,075 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-05 10:22:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:35,076 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:22:35,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:22:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:22:35,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:22:35,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:35,077 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-05 10:22:35,077 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:35,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash 44185983, now seen corresponding path program 51 times [2019-08-05 10:22:35,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:35,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:22:35,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:36,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:36,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:36,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:36,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:36,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:36,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:22:36,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:22:36,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:22:36,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3069, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:22:36,665 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 57 states. [2019-08-05 10:22:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:41,522 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:22:41,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:22:41,522 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 106 [2019-08-05 10:22:41,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:41,523 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:22:41,524 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:22:41,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=368, Invalid=10762, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:22:41,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:22:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:22:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:22:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:22:41,527 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-05 10:22:41,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:41,527 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:22:41,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:22:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:22:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:22:41,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:41,528 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-05 10:22:41,529 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:41,529 INFO L82 PathProgramCache]: Analyzing trace with hash -486878522, now seen corresponding path program 52 times [2019-08-05 10:22:41,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:41,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:22:41,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:42,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:42,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:43,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:43,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:43,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:43,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:43,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:43,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:22:43,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:22:43,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:22:43,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=3400, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:22:43,504 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 60 states. [2019-08-05 10:22:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:48,628 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:22:48,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:22:48,629 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 108 [2019-08-05 10:22:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:48,630 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:22:48,630 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:22:48,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=380, Invalid=11176, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:22:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:22:48,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:22:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:22:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:22:48,633 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-08-05 10:22:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:48,634 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:22:48,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:22:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:22:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:22:48,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:48,634 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2019-08-05 10:22:48,634 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:48,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:48,635 INFO L82 PathProgramCache]: Analyzing trace with hash 261240397, now seen corresponding path program 53 times [2019-08-05 10:22:48,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:48,668 WARN L254 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:22:48,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:49,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:50,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:50,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:50,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:50,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:50,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:50,595 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:50,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:50,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:50,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:22:50,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:22:50,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:22:50,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=3749, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:22:50,739 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 63 states. [2019-08-05 10:22:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:55,942 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:22:55,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:22:55,943 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 110 [2019-08-05 10:22:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:55,944 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:22:55,944 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:22:55,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=392, Invalid=11598, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:22:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:22:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:22:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:22:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:22:55,948 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-08-05 10:22:55,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:55,949 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:22:55,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:22:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:22:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:22:55,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:55,950 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2019-08-05 10:22:55,950 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:55,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1943983124, now seen corresponding path program 54 times [2019-08-05 10:22:55,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:55,976 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:22:55,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:57,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:57,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:57,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:57,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:57,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:57,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:57,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:57,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:57,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:57,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:58,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:58,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:22:58,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:22:58,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:22:58,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=4116, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:22:58,004 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 66 states. [2019-08-05 10:23:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:03,299 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:23:03,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:23:03,299 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 112 [2019-08-05 10:23:03,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:03,301 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:23:03,301 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:23:03,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=404, Invalid=12028, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:23:03,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:23:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:23:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:23:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:23:03,305 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-08-05 10:23:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:03,305 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:23:03,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:23:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:23:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:23:03,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:03,306 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2019-08-05 10:23:03,306 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:03,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:03,307 INFO L82 PathProgramCache]: Analyzing trace with hash -142926821, now seen corresponding path program 55 times [2019-08-05 10:23:03,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:03,335 WARN L254 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:23:03,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:04,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:04,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:04,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:04,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:05,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:05,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:05,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:05,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:05,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:05,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:05,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:05,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:05,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:05,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:23:05,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:23:05,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:23:05,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=4501, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:23:05,855 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 69 states. [2019-08-05 10:23:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:11,175 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:23:11,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:23:11,176 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 114 [2019-08-05 10:23:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:11,177 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:23:11,177 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:23:11,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=416, Invalid=12466, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:23:11,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:23:11,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:23:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:23:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:23:11,181 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-08-05 10:23:11,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:11,181 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:23:11,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:23:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:23:11,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:23:11,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:11,182 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2019-08-05 10:23:11,182 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:11,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:11,183 INFO L82 PathProgramCache]: Analyzing trace with hash 86343266, now seen corresponding path program 56 times [2019-08-05 10:23:11,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:11,209 WARN L254 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:23:11,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:12,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:12,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:12,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:12,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:12,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:12,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:12,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:12,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:12,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:13,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:13,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:13,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:13,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:14,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:14,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:14,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:23:14,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:23:14,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:23:14,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=4904, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:23:14,076 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 72 states. [2019-08-05 10:23:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:19,579 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:23:19,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:23:19,579 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 116 [2019-08-05 10:23:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:19,580 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:23:19,580 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:23:19,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=428, Invalid=12912, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:23:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:23:19,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:23:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:23:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:23:19,584 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-08-05 10:23:19,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:19,584 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:23:19,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:23:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:23:19,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:23:19,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:19,586 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2019-08-05 10:23:19,586 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:19,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:19,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1371564777, now seen corresponding path program 57 times [2019-08-05 10:23:19,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:19,636 WARN L254 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:23:19,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:20,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:20,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:20,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:21,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:21,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:21,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:21,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:21,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:21,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:21,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:21,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:21,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:22,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:22,120 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:22,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:22,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:22,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:22,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:23:22,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:23:22,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:23:22,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=5325, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:23:22,383 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 75 states. [2019-08-05 10:23:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:28,178 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 10:23:28,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:23:28,179 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 118 [2019-08-05 10:23:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:28,180 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:23:28,180 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:23:28,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1812 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=440, Invalid=13366, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:23:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:23:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:23:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:23:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:23:28,184 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-08-05 10:23:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:28,184 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:23:28,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:23:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:23:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:23:28,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:28,184 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2019-08-05 10:23:28,185 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:28,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:28,185 INFO L82 PathProgramCache]: Analyzing trace with hash -481144400, now seen corresponding path program 58 times [2019-08-05 10:23:28,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:28,213 WARN L254 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:23:28,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:28,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:29,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:29,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:29,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:29,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:29,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:29,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:29,642 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:29,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:29,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:30,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:30,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:30,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:30,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:30,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:30,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:30,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:31,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:31,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:31,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:23:31,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:23:31,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:23:31,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=5764, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:23:31,125 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 78 states. [2019-08-05 10:23:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:36,931 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 10:23:36,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:23:36,932 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 120 [2019-08-05 10:23:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:36,933 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:23:36,933 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:23:36,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1924 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=452, Invalid=13828, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:23:36,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:23:36,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 10:23:36,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:23:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-08-05 10:23:36,936 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-08-05 10:23:36,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:36,936 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-08-05 10:23:36,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:23:36,937 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-08-05 10:23:36,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:23:36,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:36,938 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2019-08-05 10:23:36,938 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:36,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:36,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1476764343, now seen corresponding path program 59 times [2019-08-05 10:23:36,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:36,967 WARN L254 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:23:36,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:37,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:37,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:37,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:38,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:38,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:38,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:38,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:38,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:38,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:38,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:38,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:38,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:38,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:39,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:39,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:39,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:39,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:39,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:39,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:39,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:39,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:39,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:23:39,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:23:39,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:23:39,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=6221, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:23:39,803 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 81 states. [2019-08-05 10:23:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:45,907 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-05 10:23:45,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:23:45,907 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 122 [2019-08-05 10:23:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:45,908 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:23:45,908 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:23:45,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2043 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=464, Invalid=14298, Unknown=0, NotChecked=0, Total=14762 [2019-08-05 10:23:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:23:45,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-05 10:23:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:23:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-05 10:23:45,912 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-08-05 10:23:45,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:45,912 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-05 10:23:45,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:23:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-05 10:23:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:23:45,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:45,913 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2019-08-05 10:23:45,913 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:45,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:45,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1831390718, now seen corresponding path program 60 times [2019-08-05 10:23:45,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:45,943 WARN L254 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 10:23:45,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:46,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:46,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:46,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:47,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:47,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:47,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:47,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:47,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:47,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:47,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:47,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:47,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:47,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:48,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:48,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:48,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:48,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:48,572 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:48,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:48,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:48,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:49,071 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:49,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:49,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:23:49,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:23:49,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:23:49,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=6696, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:23:49,139 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 84 states. [2019-08-05 10:23:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:55,247 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-08-05 10:23:55,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:23:55,248 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 124 [2019-08-05 10:23:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:55,249 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:23:55,249 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:23:55,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2169 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=476, Invalid=14776, Unknown=0, NotChecked=0, Total=15252 [2019-08-05 10:23:55,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:23:55,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-05 10:23:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:23:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-08-05 10:23:55,253 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-08-05 10:23:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:55,253 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-08-05 10:23:55,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:23:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-08-05 10:23:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 10:23:55,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:55,254 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2019-08-05 10:23:55,254 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:55,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:55,255 INFO L82 PathProgramCache]: Analyzing trace with hash -970046587, now seen corresponding path program 61 times [2019-08-05 10:23:55,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:55,283 WARN L254 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:23:55,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:56,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:56,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:56,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:56,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:56,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:56,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:56,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:56,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:56,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:57,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:57,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:57,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:57,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:57,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:57,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:57,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:57,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:57,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:58,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:58,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:58,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:58,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:58,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:58,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:23:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:58,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:58,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:23:58,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:23:58,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:23:58,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=7189, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:23:58,728 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 87 states. [2019-08-05 10:24:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:04,888 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-08-05 10:24:04,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:24:04,888 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 126 [2019-08-05 10:24:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:04,889 INFO L225 Difference]: With dead ends: 129 [2019-08-05 10:24:04,889 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 10:24:04,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=488, Invalid=15262, Unknown=0, NotChecked=0, Total=15750 [2019-08-05 10:24:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 10:24:04,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-05 10:24:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 10:24:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-08-05 10:24:04,902 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-08-05 10:24:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:04,902 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-08-05 10:24:04,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:24:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-08-05 10:24:04,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:24:04,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:04,903 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2019-08-05 10:24:04,903 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:04,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:04,903 INFO L82 PathProgramCache]: Analyzing trace with hash -206802100, now seen corresponding path program 62 times [2019-08-05 10:24:04,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:04,935 WARN L254 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:24:04,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:05,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:05,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:05,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:06,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:06,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:06,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:06,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:06,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:06,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:06,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:06,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:06,981 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:07,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:07,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:07,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:07,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:07,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:07,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:07,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:08,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:08,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:08,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:08,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:08,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:08,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:08,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:08,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:08,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:24:08,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:24:08,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:24:08,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=7700, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:24:08,806 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 90 states. [2019-08-05 10:24:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:15,077 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-08-05 10:24:15,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:24:15,078 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 128 [2019-08-05 10:24:15,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:15,079 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:24:15,079 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:24:15,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2442 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=500, Invalid=15756, Unknown=0, NotChecked=0, Total=16256 [2019-08-05 10:24:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:24:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-05 10:24:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:24:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-08-05 10:24:15,082 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2019-08-05 10:24:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:15,083 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-08-05 10:24:15,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:24:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-08-05 10:24:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:24:15,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:15,084 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2019-08-05 10:24:15,084 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:15,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:15,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1168257709, now seen corresponding path program 63 times [2019-08-05 10:24:15,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:15,121 WARN L254 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:24:15,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:15,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:16,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:16,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:16,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:16,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:16,601 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:16,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:16,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:16,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:16,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:17,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:17,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:17,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:17,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:17,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:17,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:17,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:17,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:17,967 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:18,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:18,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:18,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:18,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:18,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:18,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:18,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:18,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:19,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:19,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:19,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:19,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:24:19,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:24:19,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:24:19,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=8229, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:24:19,156 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 93 states. [2019-08-05 10:24:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:25,584 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-05 10:24:25,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:24:25,584 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 130 [2019-08-05 10:24:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:25,585 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:24:25,585 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:24:25,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2589 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=512, Invalid=16258, Unknown=0, NotChecked=0, Total=16770 [2019-08-05 10:24:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:24:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 10:24:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:24:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-08-05 10:24:25,588 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2019-08-05 10:24:25,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:25,588 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-08-05 10:24:25,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:24:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-08-05 10:24:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:24:25,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:25,589 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2019-08-05 10:24:25,590 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:25,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:25,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1709129318, now seen corresponding path program 64 times [2019-08-05 10:24:25,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:25,625 WARN L254 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 10:24:25,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:26,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:26,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:26,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:26,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:26,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:26,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:27,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:27,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:27,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:27,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:27,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:27,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:27,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:27,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:27,922 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:28,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:28,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:28,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:28,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:28,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:28,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:28,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:28,899 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:29,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:29,151 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:29,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:29,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:29,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:29,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:29,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:29,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:29,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:24:29,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:24:29,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:24:29,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=8776, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:24:29,847 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 96 states. [2019-08-05 10:24:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:36,471 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-08-05 10:24:36,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:24:36,472 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 132 [2019-08-05 10:24:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:36,472 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:24:36,473 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:24:36,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2743 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=524, Invalid=16768, Unknown=0, NotChecked=0, Total=17292 [2019-08-05 10:24:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:24:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-08-05 10:24:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 10:24:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-08-05 10:24:36,475 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2019-08-05 10:24:36,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:36,475 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2019-08-05 10:24:36,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:24:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2019-08-05 10:24:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:24:36,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:36,476 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2019-08-05 10:24:36,477 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:36,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:36,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1795702751, now seen corresponding path program 65 times [2019-08-05 10:24:36,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:36,519 WARN L254 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:24:36,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:37,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:37,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:37,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:37,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:37,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:37,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:38,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:38,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:38,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:38,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:38,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:38,521 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:38,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:38,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:38,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:38,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:39,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:39,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:39,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:39,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:39,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:39,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:39,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:39,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:40,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:40,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:40,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:40,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:40,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:40,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:40,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:40,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:41,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:41,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:24:41,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:24:41,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:24:41,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=9341, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:24:41,109 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 99 states. [2019-08-05 10:24:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:48,188 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-08-05 10:24:48,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:24:48,189 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 134 [2019-08-05 10:24:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:48,190 INFO L225 Difference]: With dead ends: 137 [2019-08-05 10:24:48,190 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 10:24:48,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2904 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=536, Invalid=17286, Unknown=0, NotChecked=0, Total=17822 [2019-08-05 10:24:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 10:24:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-08-05 10:24:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:24:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-08-05 10:24:48,193 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2019-08-05 10:24:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:48,193 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-08-05 10:24:48,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:24:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-08-05 10:24:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-05 10:24:48,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:48,194 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2019-08-05 10:24:48,194 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:48,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:48,194 INFO L82 PathProgramCache]: Analyzing trace with hash 906574056, now seen corresponding path program 66 times [2019-08-05 10:24:48,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:48,225 WARN L254 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:24:48,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:49,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:50,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:50,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:50,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:50,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:50,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:50,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:50,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:50,643 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:50,732 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:50,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:50,922 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:51,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:51,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:51,222 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:51,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:51,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:51,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:51,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:51,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:52,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:52,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:52,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:52,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:52,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:52,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:52,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:53,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:53,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:53,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:53,507 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:53,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:53,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:53,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:53,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:53,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:24:53,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:24:53,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:24:53,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=9924, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:24:53,973 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 102 states. [2019-08-05 10:25:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:00,735 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-08-05 10:25:00,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:25:00,735 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 136 [2019-08-05 10:25:00,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:00,736 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:25:00,736 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:25:00,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3072 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=548, Invalid=17812, Unknown=0, NotChecked=0, Total=18360 [2019-08-05 10:25:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:25:00,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-05 10:25:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 10:25:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-08-05 10:25:00,740 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2019-08-05 10:25:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:00,740 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-08-05 10:25:00,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:25:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-08-05 10:25:00,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:25:00,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:00,741 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2019-08-05 10:25:00,742 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:00,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:00,742 INFO L82 PathProgramCache]: Analyzing trace with hash -660628497, now seen corresponding path program 67 times [2019-08-05 10:25:00,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:00,773 WARN L254 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:25:00,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:01,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:01,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:01,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:01,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:01,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:01,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:01,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:01,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:02,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:02,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:02,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:02,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:02,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:02,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:02,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:02,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:03,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:03,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:03,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:03,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:03,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:03,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:03,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:03,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:04,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:04,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:04,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:04,491 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:04,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:04,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:04,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:05,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:05,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:05,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:05,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:05,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:05,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:05,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:25:05,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:25:05,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:25:05,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=10525, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:25:05,643 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 105 states. [2019-08-05 10:25:13,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:13,060 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-08-05 10:25:13,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:25:13,061 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 138 [2019-08-05 10:25:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:13,062 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:25:13,062 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:25:13,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3247 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=560, Invalid=18346, Unknown=0, NotChecked=0, Total=18906 [2019-08-05 10:25:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:25:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-08-05 10:25:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:25:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-08-05 10:25:13,065 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2019-08-05 10:25:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:13,065 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-08-05 10:25:13,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:25:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-08-05 10:25:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:25:13,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:13,066 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2019-08-05 10:25:13,066 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:13,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:13,067 INFO L82 PathProgramCache]: Analyzing trace with hash 791238966, now seen corresponding path program 68 times [2019-08-05 10:25:13,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:13,095 WARN L254 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-05 10:25:13,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:13,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:13,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:13,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:13,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:13,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:14,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:14,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:14,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:14,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:14,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:14,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:14,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:14,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:14,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:14,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:14,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:15,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:15,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:15,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:15,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:15,530 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:15,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:15,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:15,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:16,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:16,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:16,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:16,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:16,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:16,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:16,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:16,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:17,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:17,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:17,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:17,573 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:17,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:17,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:25:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:17,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:17,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:25:17,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:25:17,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:25:17,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=11144, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:25:17,898 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 108 states. Received shutdown request... [2019-08-05 10:25:23,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:25:23,041 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:25:23,047 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:25:23,048 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:25:23 BoogieIcfgContainer [2019-08-05 10:25:23,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:25:23,049 INFO L168 Benchmark]: Toolchain (without parser) took 244525.43 ms. Allocated memory was 134.2 MB in the beginning and 504.4 MB in the end (delta: 370.1 MB). Free memory was 110.6 MB in the beginning and 342.3 MB in the end (delta: -231.7 MB). Peak memory consumption was 138.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:23,050 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:25:23,051 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.33 ms. Allocated memory is still 134.2 MB. Free memory was 110.2 MB in the beginning and 108.9 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:25:23,051 INFO L168 Benchmark]: Boogie Preprocessor took 22.90 ms. Allocated memory is still 134.2 MB. Free memory was 108.9 MB in the beginning and 107.7 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:25:23,052 INFO L168 Benchmark]: RCFGBuilder took 359.06 ms. Allocated memory is still 134.2 MB. Free memory was 107.7 MB in the beginning and 96.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:23,052 INFO L168 Benchmark]: TraceAbstraction took 244100.14 ms. Allocated memory was 134.2 MB in the beginning and 504.4 MB in the end (delta: 370.1 MB). Free memory was 96.3 MB in the beginning and 342.3 MB in the end (delta: -246.0 MB). Peak memory consumption was 124.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:23,055 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.23 ms. Allocated memory is still 134.2 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.33 ms. Allocated memory is still 134.2 MB. Free memory was 110.2 MB in the beginning and 108.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.90 ms. Allocated memory is still 134.2 MB. Free memory was 108.9 MB in the beginning and 107.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 359.06 ms. Allocated memory is still 134.2 MB. Free memory was 107.7 MB in the beginning and 96.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244100.14 ms. Allocated memory was 134.2 MB in the beginning and 504.4 MB in the end (delta: 370.1 MB). Free memory was 96.3 MB in the beginning and 342.3 MB in the end (delta: -246.0 MB). Peak memory consumption was 124.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (141states) and FLOYD_HOARE automaton (currently 62 states, 108 states before enhancement),while ReachableStatesComputation was computing reachable states (91 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 244.0s OverallTime, 69 OverallIterations, 69 TraceHistogramMax, 153.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 205 SDtfs, 35 SDslu, 1210 SDs, 0 SdLazy, 131016 SolverSat, 5271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 75.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7003 GetRequests, 2054 SyntacticMatches, 19 SemanticMatches, 4930 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65456 ImplicationChecksByTransitivity, 146.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=68, 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, 68 MinimizatonAttempts, 50 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 88.3s InterpolantComputationTime, 4968 NumberOfCodeBlocks, 4968 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 4899 ConstructedInterpolants, 0 QuantifiedInterpolants, 1731021 SizeOfPredicates, 295 NumberOfNonLiveVariables, 10419 ConjunctsInSsa, 3883 ConjunctsInUnsatCore, 69 InterpolantComputations, 1 PerfectInterpolantSequences, 0/109480 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown