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/toy/INT_anubhav.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:43:23,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:43:23,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:43:23,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:43:23,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:43:23,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:43:23,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:43:23,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:43:23,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:43:23,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:43:23,589 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:43:23,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:43:23,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:43:23,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:43:23,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:43:23,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:43:23,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:43:23,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:43:23,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:43:23,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:43:23,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:43:23,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:43:23,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:43:23,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:43:23,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:43:23,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:43:23,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:43:23,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:43:23,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:43:23,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:43:23,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:43:23,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:43:23,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:43:23,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:43:23,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:43:23,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:43:23,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:43:23,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:43:23,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:43:23,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:43:23,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:43:23,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:43:23,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:43:23,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:43:23,659 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:43:23,660 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:43:23,660 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/INT_anubhav.bpl [2019-08-05 10:43:23,661 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/INT_anubhav.bpl' [2019-08-05 10:43:23,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:43:23,690 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:43:23,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:23,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:43:23,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:43:23,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:23" (1/1) ... [2019-08-05 10:43:23,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:23" (1/1) ... [2019-08-05 10:43:23,723 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:43:23,723 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:43:23,724 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:43:23,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:23,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:43:23,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:43:23,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:43:23,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:23" (1/1) ... [2019-08-05 10:43:23,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:23" (1/1) ... [2019-08-05 10:43:23,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:23" (1/1) ... [2019-08-05 10:43:23,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:23" (1/1) ... [2019-08-05 10:43:23,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:23" (1/1) ... [2019-08-05 10:43:23,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:23" (1/1) ... [2019-08-05 10:43:23,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:23" (1/1) ... [2019-08-05 10:43:23,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:43:23,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:43:23,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:43:23,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:43:23,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:23" (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:43:23,823 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:43:23,823 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:43:23,823 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:43:24,090 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:43:24,091 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:43:24,093 INFO L202 PluginConnector]: Adding new model INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:24 BoogieIcfgContainer [2019-08-05 10:43:24,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:43:24,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:43:24,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:43:24,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:43:24,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:23" (1/2) ... [2019-08-05 10:43:24,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b20ffb and model type INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:43:24, skipping insertion in model container [2019-08-05 10:43:24,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:24" (2/2) ... [2019-08-05 10:43:24,104 INFO L109 eAbstractionObserver]: Analyzing ICFG INT_anubhav.bpl [2019-08-05 10:43:24,114 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:43:24,123 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:43:24,142 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:43:24,171 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:43:24,172 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:43:24,173 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:43:24,173 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:43:24,173 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:43:24,173 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:43:24,173 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:43:24,174 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:43:24,174 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:43:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:43:24,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:43:24,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:24,202 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:43:24,205 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:24,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:24,211 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 10:43:24,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:24,300 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:43:24,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:24,506 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:43:24,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:24,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:43:24,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:43:24,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:43:24,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:43:24,528 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2019-08-05 10:43:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:24,678 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:43:24,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:43:24,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:43:24,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:24,691 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:43:24,691 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:43:24,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:43:24,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:43:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:43:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:43:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:43:24,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:43:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:24,727 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:43:24,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:43:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:43:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:43:24,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:24,728 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:43:24,729 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:24,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:24,729 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 10:43:24,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:24,751 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:43:24,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:24,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:24,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:43:24,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:43:24,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:43:24,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:43:24,895 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 10:43:24,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:24,967 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:43:24,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:43:24,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:43:24,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:24,969 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:43:24,969 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:43:24,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:24,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:43:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:43:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:43:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:43:24,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:43:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:24,973 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:43:24,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:43:24,974 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:43:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:43:24,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:24,974 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:43:24,975 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:24,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:24,975 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-05 10:43:24,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:24,989 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:43:24,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:25,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:25,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:43:25,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:43:25,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:43:25,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:25,245 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 10:43:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:25,453 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:43:25,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:43:25,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:43:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:25,454 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:43:25,454 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:43:25,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:25,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:43:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:43:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:43:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:43:25,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:43:25,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:25,457 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:43:25,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:43:25,458 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:43:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:43:25,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:25,458 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:43:25,458 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-08-05 10:43:25,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:25,474 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:43:25,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:25,621 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:43:25,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:25,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:43:25,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:43:25,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:43:25,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:25,624 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 10:43:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:25,828 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:43:25,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:43:25,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:43:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:25,829 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:43:25,830 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:43:25,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:43:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:43:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:43:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:43:25,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:43:25,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:25,833 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:43:25,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:43:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:43:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:43:25,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:25,834 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:43:25,835 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:25,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:25,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-08-05 10:43:25,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:25,852 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:43:25,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:26,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:26,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:43:26,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:43:26,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:43:26,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:26,045 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 10:43:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:26,149 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:43:26,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:43:26,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:43:26,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:26,151 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:43:26,151 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:43:26,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:26,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:43:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:43:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:43:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:43:26,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:43:26,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:26,154 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:43:26,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:43:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:43:26,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:43:26,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:26,155 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:43:26,155 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:26,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:26,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-08-05 10:43:26,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:26,175 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:43:26,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:26,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:26,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:43:26,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:43:26,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:43:26,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:26,597 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 10:43:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:26,692 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:43:26,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:43:26,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:43:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:26,693 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:43:26,693 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:43:26,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:43:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:43:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:43:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:43:26,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:43:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:26,696 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:43:26,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:43:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:43:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:43:26,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:26,697 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:43:26,697 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:26,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:26,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-08-05 10:43:26,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:26,717 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:43:26,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:26,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:26,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:43:26,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:43:26,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:43:26,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:26,875 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 10:43:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:27,020 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:43:27,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:43:27,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:43:27,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:27,023 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:43:27,023 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:43:27,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:27,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:43:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:43:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:43:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:43:27,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:43:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:27,026 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:43:27,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:43:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:43:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:43:27,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:27,027 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:43:27,027 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:27,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:27,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-08-05 10:43:27,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:27,049 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:43:27,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:27,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:27,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:43:27,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:43:27,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:43:27,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:27,342 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 10:43:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:27,488 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:43:27,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:43:27,488 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:43:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:27,489 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:43:27,490 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:43:27,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:43:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:43:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:43:27,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:43:27,494 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:43:27,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:27,494 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:43:27,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:43:27,494 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:43:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:43:27,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:27,495 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:43:27,495 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:27,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:27,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-08-05 10:43:27,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:27,517 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:43:27,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:27,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:27,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:43:27,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:43:27,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:43:27,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:27,683 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 10:43:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:27,833 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:43:27,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:43:27,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:43:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:27,835 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:43:27,835 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:43:27,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:43:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:43:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:43:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:43:27,838 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:43:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:27,838 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:43:27,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:43:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:43:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:43:27,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:27,839 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:43:27,839 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:27,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:27,839 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2019-08-05 10:43:27,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:27,862 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:43:27,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:28,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:28,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:43:28,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:43:28,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:43:28,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:28,112 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 10:43:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:28,299 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:43:28,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:43:28,299 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:43:28,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:28,300 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:43:28,300 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:43:28,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:28,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:43:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:43:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:43:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:43:28,303 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:43:28,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:28,304 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:43:28,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:43:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:43:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:28,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:28,304 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:43:28,305 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:28,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:28,305 INFO L82 PathProgramCache]: Analyzing trace with hash -258347808, now seen corresponding path program 10 times [2019-08-05 10:43:28,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:28,324 WARN L254 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:43:28,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:28,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:28,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:43:28,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:43:28,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:43:28,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:28,583 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 10:43:28,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:28,790 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:43:28,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:43:28,791 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:43:28,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:28,792 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:43:28,792 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:43:28,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:43:28,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:43:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:43:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:43:28,796 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:43:28,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:28,796 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:43:28,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:43:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:43:28,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:28,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:28,797 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:43:28,797 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:28,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:28,797 INFO L82 PathProgramCache]: Analyzing trace with hash 581150598, now seen corresponding path program 11 times [2019-08-05 10:43:28,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:28,815 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:43:28,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:29,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:29,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:29,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:29,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:29,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:29,194 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-05 10:43:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:29,389 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:43:29,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:29,389 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:43:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:29,390 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:43:29,391 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:43:29,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:43:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:43:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:43:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:43:29,394 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:43:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:29,394 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:43:29,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:43:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:43:29,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:29,395 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:43:29,395 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:29,396 INFO L82 PathProgramCache]: Analyzing trace with hash 835797408, now seen corresponding path program 12 times [2019-08-05 10:43:29,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:29,415 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:43:29,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:29,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:29,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:43:29,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:43:29,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:43:29,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:29,746 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-08-05 10:43:30,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:30,235 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:43:30,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:43:30,235 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:43:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:30,236 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:43:30,236 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:43:30,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:43:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:43:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:43:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:43:30,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:43:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:30,242 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:43:30,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:43:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:43:30,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:43:30,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:30,243 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:43:30,243 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:30,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:30,243 INFO L82 PathProgramCache]: Analyzing trace with hash 139913926, now seen corresponding path program 13 times [2019-08-05 10:43:30,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:30,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:43:30,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:30,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:30,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:43:30,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:43:30,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:43:30,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:30,901 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-08-05 10:43:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:31,196 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:43:31,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:43:31,196 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:43:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:31,197 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:43:31,197 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:43:31,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:43:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:43:31,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:43:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:43:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:43:31,201 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:43:31,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:31,202 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:43:31,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:43:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:43:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:43:31,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:31,203 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:43:31,203 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:31,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:31,203 INFO L82 PathProgramCache]: Analyzing trace with hash 42362464, now seen corresponding path program 14 times [2019-08-05 10:43:31,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:31,221 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:43:31,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:31,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:31,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:43:31,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:43:31,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:43:31,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:43:31,792 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-08-05 10:43:32,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:32,058 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:43:32,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:43:32,059 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:43:32,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:32,060 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:43:32,060 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:43:32,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:43:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:43:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:43:32,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:43:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:43:32,064 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:43:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:32,064 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:43:32,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:43:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:43:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:43:32,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:32,065 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:43:32,065 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:32,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234438, now seen corresponding path program 15 times [2019-08-05 10:43:32,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:32,083 WARN L254 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:43:32,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:32,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:32,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:43:32,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:43:32,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:43:32,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:43:32,496 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-08-05 10:43:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:32,801 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:43:32,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:43:32,802 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:43:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:32,803 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:43:32,803 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:43:32,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:43:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:43:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:43:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:43:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:43:32,809 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:43:32,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:32,810 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:43:32,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:43:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:43:32,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:43:32,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:32,811 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:43:32,811 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:32,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:32,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559968, now seen corresponding path program 16 times [2019-08-05 10:43:32,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:32,828 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:43:32,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:33,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:33,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:43:33,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:43:33,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:43:33,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:43:33,404 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-08-05 10:43:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:33,773 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:43:33,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:43:33,773 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:43:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:33,774 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:43:33,774 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:43:33,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:43:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:43:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:43:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:43:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:43:33,778 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:43:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:33,778 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:43:33,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:43:33,778 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:43:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:43:33,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:33,779 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:43:33,779 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:33,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:33,779 INFO L82 PathProgramCache]: Analyzing trace with hash -702152378, now seen corresponding path program 17 times [2019-08-05 10:43:33,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:33,795 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:43:33,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:34,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:34,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:43:34,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:43:34,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:43:34,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:43:34,204 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-08-05 10:43:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:34,615 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:43:34,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:43:34,615 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:43:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:34,616 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:43:34,616 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:43:34,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:43:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:43:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:43:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:43:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:43:34,620 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:43:34,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:34,620 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:43:34,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:43:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:43:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:43:34,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:34,621 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:43:34,621 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:34,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:34,622 INFO L82 PathProgramCache]: Analyzing trace with hash -291889184, now seen corresponding path program 18 times [2019-08-05 10:43:34,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:34,636 WARN L254 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:43:34,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:35,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:35,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:43:35,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:43:35,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:43:35,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:43:35,111 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-08-05 10:43:35,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:35,492 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:43:35,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:43:35,493 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:43:35,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:35,494 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:43:35,494 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:43:35,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:43:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:43:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:43:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:43:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:43:35,498 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:43:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:35,499 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:43:35,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:43:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:43:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:43:35,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:35,500 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:43:35,500 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:35,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:35,500 INFO L82 PathProgramCache]: Analyzing trace with hash -458632058, now seen corresponding path program 19 times [2019-08-05 10:43:35,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:35,515 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:43:35,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:35,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:35,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:43:35,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:43:35,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:43:35,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:43:35,887 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2019-08-05 10:43:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:36,336 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:43:36,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:43:36,337 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:43:36,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:36,338 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:43:36,338 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:43:36,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:43:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:43:36,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:43:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:43:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:43:36,341 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:43:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:36,341 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:43:36,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:43:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:43:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:43:36,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:36,342 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:43:36,342 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:36,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693856, now seen corresponding path program 20 times [2019-08-05 10:43:36,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:36,359 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:43:36,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:36,785 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:43:36,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:36,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:43:36,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:43:36,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:43:36,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:43:36,787 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2019-08-05 10:43:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:37,292 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:43:37,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:43:37,293 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:43:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:37,293 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:43:37,294 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:43:37,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:43:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:43:37,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:43:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:43:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:43:37,297 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:43:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:37,297 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:43:37,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:43:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:43:37,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:43:37,298 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:37,298 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:43:37,298 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:37,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:37,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161478, now seen corresponding path program 21 times [2019-08-05 10:43:37,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:37,314 WARN L254 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:43:37,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:37,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:37,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:43:37,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:43:37,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:43:37,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:43:37,812 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2019-08-05 10:43:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:39,229 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:43:39,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:43:39,231 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:43:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:39,232 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:43:39,232 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:43:39,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:43:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:43:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:43:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:43:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:43:39,236 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:43:39,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:39,236 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:43:39,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:43:39,237 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:43:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:43:39,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:39,237 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:43:39,237 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:39,238 INFO L82 PathProgramCache]: Analyzing trace with hash -818603680, now seen corresponding path program 22 times [2019-08-05 10:43:39,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:39,253 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:43:39,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:39,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:39,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:43:39,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:43:39,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:43:39,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:43:39,853 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2019-08-05 10:43:40,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:40,447 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:43:40,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:43:40,448 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:43:40,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:40,448 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:43:40,449 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:43:40,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:43:40,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:43:40,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:43:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:43:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:43:40,452 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:43:40,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:40,453 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:43:40,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:43:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:43:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:43:40,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:40,454 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:43:40,454 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:40,454 INFO L82 PathProgramCache]: Analyzing trace with hash 393087750, now seen corresponding path program 23 times [2019-08-05 10:43:40,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:40,471 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:43:40,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:41,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:41,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:43:41,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:43:41,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:43:41,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:43:41,112 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2019-08-05 10:43:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:41,746 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:43:41,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:43:41,751 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:43:41,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:41,752 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:43:41,752 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:43:41,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:43:41,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:43:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:43:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:43:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:43:41,755 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:43:41,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:41,755 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:43:41,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:43:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:43:41,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:43:41,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:41,756 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:43:41,757 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:41,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:41,757 INFO L82 PathProgramCache]: Analyzing trace with hash -699183584, now seen corresponding path program 24 times [2019-08-05 10:43:41,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:41,772 WARN L254 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:43:41,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:42,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:42,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:43:42,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:43:42,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:43:42,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:43:42,470 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2019-08-05 10:43:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:43,079 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:43:43,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:43:43,079 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 10:43:43,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:43,080 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:43:43,080 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:43:43,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:43:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:43:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:43:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:43:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:43:43,085 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:43:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:43,086 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:43:43,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:43:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:43:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:43:43,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:43,087 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:43:43,087 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:43,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:43,088 INFO L82 PathProgramCache]: Analyzing trace with hash -199856570, now seen corresponding path program 25 times [2019-08-05 10:43:43,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:43,106 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:43:43,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:43,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:43,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:43:43,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:43:43,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:43:43,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:43:43,930 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2019-08-05 10:43:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:44,594 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:43:44,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:43:44,594 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 10:43:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:44,595 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:43:44,595 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:43:44,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:43:44,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:43:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:43:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:43:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:43:44,599 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:43:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:44,599 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:43:44,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:43:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:43:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:43:44,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:44,600 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:43:44,600 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:44,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588320, now seen corresponding path program 26 times [2019-08-05 10:43:44,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:44,617 WARN L254 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:43:44,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:45,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:45,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:43:45,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:43:45,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:43:45,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:43:45,191 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2019-08-05 10:43:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:45,868 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:43:45,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:43:45,869 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 10:43:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:45,870 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:43:45,870 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:43:45,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:43:45,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:43:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:43:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:43:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:43:45,873 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:43:45,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:45,874 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:43:45,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:43:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:43:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:43:45,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:45,875 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:43:45,875 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:45,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:45,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302278, now seen corresponding path program 27 times [2019-08-05 10:43:45,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:45,892 WARN L254 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:43:45,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:47,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:47,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:43:47,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:43:47,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:43:47,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:43:47,270 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2019-08-05 10:43:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:47,979 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:43:47,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:43:47,980 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 10:43:47,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:47,981 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:43:47,981 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:43:47,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:43:47,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:43:47,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:43:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:43:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:43:47,985 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:43:47,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:47,985 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:43:47,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:43:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:43:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:43:47,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:47,986 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:43:47,986 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:47,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336992, now seen corresponding path program 28 times [2019-08-05 10:43:47,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:48,017 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 10:43:48,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:49,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:49,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:43:49,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:43:49,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:43:49,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:43:49,375 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-08-05 10:43:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:50,190 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:43:50,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:43:50,191 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 10:43:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:50,192 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:43:50,192 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:43:50,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:43:50,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:43:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:43:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:43:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:43:50,196 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:43:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:50,196 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:43:50,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:43:50,196 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:43:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:43:50,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:50,197 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:43:50,197 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:50,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:50,198 INFO L82 PathProgramCache]: Analyzing trace with hash 125289670, now seen corresponding path program 29 times [2019-08-05 10:43:50,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:50,215 WARN L254 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 10:43:50,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:50,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:50,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:43:50,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:43:50,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:43:50,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:43:50,889 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2019-08-05 10:43:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:51,765 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:43:51,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:43:51,766 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 10:43:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:51,767 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:43:51,767 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:43:51,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:43:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:43:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:43:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:43:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:43:51,771 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:43:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:51,771 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:43:51,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:43:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:43:51,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:43:51,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:51,772 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:43:51,772 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:51,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:51,773 INFO L82 PathProgramCache]: Analyzing trace with hash -410989472, now seen corresponding path program 30 times [2019-08-05 10:43:51,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:51,786 WARN L254 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:43:51,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:52,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:52,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:43:52,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:43:52,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:43:52,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:43:52,492 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2019-08-05 10:43:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:53,386 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:43:53,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:43:53,389 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 10:43:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:53,390 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:43:53,390 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:43:53,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:43:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:43:53,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:43:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:43:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:43:53,393 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:43:53,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:53,393 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:43:53,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:43:53,393 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:43:53,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:43:53,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:53,394 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:43:53,394 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:53,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:53,395 INFO L82 PathProgramCache]: Analyzing trace with hash 144226310, now seen corresponding path program 31 times [2019-08-05 10:43:53,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:53,411 WARN L254 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 10:43:53,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:54,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:54,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:43:54,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:43:54,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:43:54,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:43:54,573 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2019-08-05 10:43:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:55,500 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:43:55,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:43:55,500 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 10:43:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:55,501 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:43:55,501 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:43:55,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:43:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:43:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:43:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:43:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:43:55,505 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:43:55,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:55,505 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:43:55,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:43:55,505 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:43:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:43:55,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:55,506 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:43:55,506 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:55,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:55,506 INFO L82 PathProgramCache]: Analyzing trace with hash 176046368, now seen corresponding path program 32 times [2019-08-05 10:43:55,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:55,525 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 10:43:55,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:56,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:56,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:43:56,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:43:56,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:43:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:43:56,679 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2019-08-05 10:43:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:57,660 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:43:57,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:43:57,661 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 10:43:57,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:57,661 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:43:57,661 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:43:57,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:43:57,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:43:57,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:43:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:43:57,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:43:57,665 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:43:57,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:57,665 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:43:57,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:43:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:43:57,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:43:57,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:57,666 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:43:57,666 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:57,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468166, now seen corresponding path program 33 times [2019-08-05 10:43:57,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:57,685 WARN L254 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:43:57,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:59,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:59,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:43:59,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:43:59,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:43:59,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:43:59,064 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2019-08-05 10:44:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:00,107 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:44:00,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:44:00,108 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 10:44:00,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:00,108 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:44:00,108 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:44:00,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:44:00,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:44:00,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:44:00,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:44:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:44:00,112 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:44:00,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:00,112 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:44:00,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:44:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:44:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:44:00,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:00,113 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:44:00,113 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:00,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:00,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772832, now seen corresponding path program 34 times [2019-08-05 10:44:00,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:00,130 WARN L254 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 10:44:00,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:01,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:01,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:44:01,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:44:01,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:44:01,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:44:01,091 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2019-08-05 10:44:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:02,185 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:44:02,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:44:02,186 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 10:44:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:02,186 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:02,186 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:02,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:44:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:02,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:44:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:44:02,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:44:02,190 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:44:02,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:02,190 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:44:02,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:44:02,190 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:44:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:44:02,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:02,191 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:44:02,191 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:02,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:02,191 INFO L82 PathProgramCache]: Analyzing trace with hash 440348294, now seen corresponding path program 35 times [2019-08-05 10:44:02,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:02,211 WARN L254 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 10:44:02,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:03,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:03,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:44:03,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:44:03,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:44:03,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:44:03,154 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2019-08-05 10:44:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:04,371 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:44:04,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:44:04,371 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 10:44:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:04,372 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:44:04,372 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:44:04,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:44:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:44:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:44:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:44:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:44:04,375 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:44:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:04,375 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:44:04,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:44:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:44:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:44:04,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:04,376 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:44:04,376 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:04,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:04,377 INFO L82 PathProgramCache]: Analyzing trace with hash 765893280, now seen corresponding path program 36 times [2019-08-05 10:44:04,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:04,396 WARN L254 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:44:04,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:05,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:05,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:44:05,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:44:05,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:44:05,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:44:05,302 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2019-08-05 10:44:06,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:06,462 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:44:06,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:44:06,463 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 10:44:06,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:06,464 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:44:06,464 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:44:06,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=1559, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:44:06,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:44:06,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:44:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:44:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:44:06,467 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:44:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:06,467 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:44:06,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:44:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:44:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:44:06,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:06,468 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:44:06,468 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:06,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:06,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114042, now seen corresponding path program 37 times [2019-08-05 10:44:06,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:06,485 WARN L254 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 10:44:06,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:07,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:07,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:44:07,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:44:07,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:44:07,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:44:07,403 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2019-08-05 10:44:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:08,644 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:44:08,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:44:08,645 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 10:44:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:08,645 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:08,645 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:08,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1639, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:44:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:44:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:44:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:44:08,648 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:44:08,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:08,648 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:44:08,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:44:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:44:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:44:08,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:08,649 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:44:08,649 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:08,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:08,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972192, now seen corresponding path program 38 times [2019-08-05 10:44:08,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:08,669 WARN L254 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 10:44:08,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:09,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:09,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:44:09,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:44:09,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:44:09,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:44:09,863 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2019-08-05 10:44:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:11,179 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:44:11,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:44:11,179 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 10:44:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:11,180 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:44:11,180 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:44:11,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:44:11,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:44:11,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:44:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:44:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:44:11,183 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:44:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:11,184 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:44:11,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:44:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:44:11,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:44:11,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:11,184 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:44:11,185 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:11,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:11,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495750, now seen corresponding path program 39 times [2019-08-05 10:44:11,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:11,209 WARN L254 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 10:44:11,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:12,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:12,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:44:12,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:44:12,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:44:12,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:44:12,289 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2019-08-05 10:44:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:13,646 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:44:13,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:44:13,646 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 10:44:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:13,647 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:44:13,647 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:44:13,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=1805, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:44:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:44:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:44:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:44:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:44:13,650 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:44:13,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:13,651 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:44:13,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:44:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:44:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:44:13,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:13,652 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:44:13,652 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:13,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:13,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791456, now seen corresponding path program 40 times [2019-08-05 10:44:13,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:13,676 WARN L254 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 169 conjunts are in the unsatisfiable core [2019-08-05 10:44:13,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:15,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:15,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:44:15,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:44:15,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:44:15,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:44:15,080 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2019-08-05 10:44:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:16,464 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:44:16,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:44:16,471 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 10:44:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:16,472 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:16,472 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:16,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=89, Invalid=1891, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:44:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:16,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:44:16,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:44:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:44:16,475 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:44:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:16,475 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:44:16,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:44:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:44:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:44:16,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:16,476 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:44:16,476 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:16,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:16,476 INFO L82 PathProgramCache]: Analyzing trace with hash -692041658, now seen corresponding path program 41 times [2019-08-05 10:44:16,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:16,515 WARN L254 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-05 10:44:16,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:17,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:17,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:44:17,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:44:17,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:44:17,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:44:17,702 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2019-08-05 10:44:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:19,155 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:44:19,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:44:19,156 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 10:44:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:19,157 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:44:19,157 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:44:19,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:44:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:44:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:44:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:44:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:44:19,161 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:44:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:19,161 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:44:19,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:44:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:44:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:44:19,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:19,162 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:44:19,162 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash 21543136, now seen corresponding path program 42 times [2019-08-05 10:44:19,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:19,192 WARN L254 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-05 10:44:19,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:20,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:20,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:44:20,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:44:20,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:44:20,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:44:20,442 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2019-08-05 10:44:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:21,995 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:44:21,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:44:21,996 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 10:44:21,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:21,996 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:44:21,997 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:44:21,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2069, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:44:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:44:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:44:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:44:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:44:22,000 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:44:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:22,000 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:44:22,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:44:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:44:22,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:44:22,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:22,001 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:44:22,001 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:22,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:22,001 INFO L82 PathProgramCache]: Analyzing trace with hash 667835270, now seen corresponding path program 43 times [2019-08-05 10:44:22,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:22,019 WARN L254 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 181 conjunts are in the unsatisfiable core [2019-08-05 10:44:22,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:23,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:23,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:44:23,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:44:23,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:44:23,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:44:23,204 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2019-08-05 10:44:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:24,933 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:44:24,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:44:24,939 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 10:44:24,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:24,940 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:24,940 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:24,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=2161, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:44:24,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:44:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:44:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:44:24,941 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:44:24,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:24,942 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:44:24,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:44:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:44:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:44:24,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:24,942 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:44:24,943 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash -771945056, now seen corresponding path program 44 times [2019-08-05 10:44:24,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:24,967 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 185 conjunts are in the unsatisfiable core [2019-08-05 10:44:24,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:26,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:26,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:44:26,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:44:26,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:44:26,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:44:26,196 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2019-08-05 10:44:27,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:27,861 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:44:27,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:44:27,861 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 10:44:27,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:27,862 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:44:27,862 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:44:27,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:44:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:44:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:44:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:44:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:44:27,865 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:44:27,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:27,866 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:44:27,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:44:27,866 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:44:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:44:27,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:27,866 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:44:27,867 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:27,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:27,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505094, now seen corresponding path program 45 times [2019-08-05 10:44:27,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:27,895 WARN L254 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-05 10:44:27,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:29,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:29,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:44:29,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:44:29,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:44:29,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:44:29,289 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2019-08-05 10:44:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:31,190 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:44:31,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:44:31,191 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 10:44:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:31,192 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:44:31,192 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:44:31,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=2351, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:44:31,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:44:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:44:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:44:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:44:31,194 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:44:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:31,195 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:44:31,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:44:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:44:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:44:31,196 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:31,196 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:44:31,196 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:31,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081120, now seen corresponding path program 46 times [2019-08-05 10:44:31,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:31,226 WARN L254 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 193 conjunts are in the unsatisfiable core [2019-08-05 10:44:31,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:32,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:32,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:44:32,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:44:32,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:44:32,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:44:32,665 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2019-08-05 10:44:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:34,468 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:44:34,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:44:34,469 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 10:44:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:34,469 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:34,470 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:34,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=2449, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:44:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:44:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:44:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:44:34,472 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:44:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:34,472 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:44:34,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:44:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:44:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:44:34,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:34,473 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:44:34,473 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:34,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:34,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192890, now seen corresponding path program 47 times [2019-08-05 10:44:34,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:34,503 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-05 10:44:34,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:36,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:36,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:44:36,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:44:36,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:44:36,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:44:36,070 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2019-08-05 10:44:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:37,933 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:44:37,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:44:37,933 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 10:44:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:37,934 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:44:37,934 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:44:37,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=103, Invalid=2549, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:44:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:44:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:44:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:44:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:44:37,937 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:44:37,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:37,938 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:44:37,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:44:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:44:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:44:37,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:37,938 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:44:37,939 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:37,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593312, now seen corresponding path program 48 times [2019-08-05 10:44:37,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:37,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-05 10:44:37,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:39,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:39,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:44:39,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:44:39,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:44:39,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:44:39,430 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2019-08-05 10:44:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:41,537 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:44:41,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:44:41,537 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 10:44:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:41,538 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:44:41,538 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:44:41,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=2651, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:44:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:44:41,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:44:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:44:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:44:41,541 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:44:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:41,542 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:44:41,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:44:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:44:41,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:44:41,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:41,543 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:44:41,543 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:41,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:41,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314938, now seen corresponding path program 49 times [2019-08-05 10:44:41,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:41,579 WARN L254 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 205 conjunts are in the unsatisfiable core [2019-08-05 10:44:41,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:43,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:43,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:44:43,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:44:43,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:44:43,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:44:43,175 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2019-08-05 10:44:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:45,336 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:44:45,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:44:45,336 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 10:44:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:45,337 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:44:45,337 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:44:45,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=107, Invalid=2755, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:44:45,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:44:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:44:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:44:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:44:45,340 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:44:45,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:45,340 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:44:45,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:44:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:44:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:44:45,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:45,341 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:44:45,342 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:45,342 INFO L82 PathProgramCache]: Analyzing trace with hash -105059360, now seen corresponding path program 50 times [2019-08-05 10:44:45,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:45,378 WARN L254 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-05 10:44:45,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:47,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:47,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:44:47,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:44:47,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:44:47,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:44:47,056 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2019-08-05 10:44:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:49,227 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:44:49,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:44:49,228 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 10:44:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:49,229 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:44:49,229 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:44:49,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:44:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:44:49,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:44:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:44:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:44:49,232 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:44:49,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:49,233 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:44:49,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:44:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:44:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:44:49,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:49,234 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:44:49,234 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:49,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:49,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125190, now seen corresponding path program 51 times [2019-08-05 10:44:49,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:49,272 WARN L254 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-05 10:44:49,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:51,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:51,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:44:51,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:44:51,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:44:51,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:44:51,311 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2019-08-05 10:44:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:53,532 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:44:53,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:44:53,532 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 10:44:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:53,533 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:44:53,533 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:44:53,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=111, Invalid=2969, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:44:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:44:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:44:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:44:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:44:53,536 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:44:53,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:53,536 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:44:53,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:44:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:44:53,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:44:53,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:53,537 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:44:53,537 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:53,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:53,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107872, now seen corresponding path program 52 times [2019-08-05 10:44:53,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:53,578 WARN L254 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 217 conjunts are in the unsatisfiable core [2019-08-05 10:44:53,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:55,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:55,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:44:55,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:44:55,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:44:55,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:44:55,535 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-08-05 10:44:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:57,815 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:44:57,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:44:57,815 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 10:44:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:57,816 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:44:57,816 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:44:57,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:44:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:44:57,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:44:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:44:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:44:57,819 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:44:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:57,819 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:44:57,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:44:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:44:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:44:57,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:57,820 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:44:57,820 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:57,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:57,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832646, now seen corresponding path program 53 times [2019-08-05 10:44:57,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:57,860 WARN L254 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 221 conjunts are in the unsatisfiable core [2019-08-05 10:44:57,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:59,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:59,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:44:59,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:44:59,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:44:59,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:44:59,539 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2019-08-05 10:45:02,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:02,181 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:45:02,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:45:02,181 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 10:45:02,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:02,182 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:45:02,182 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:45:02,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=115, Invalid=3191, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:45:02,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:45:02,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:45:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:45:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:45:02,185 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:45:02,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:02,185 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:45:02,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:45:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:45:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:45:02,185 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:02,186 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:45:02,186 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:02,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:02,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895584, now seen corresponding path program 54 times [2019-08-05 10:45:02,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:02,215 WARN L254 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-05 10:45:02,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:03,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:03,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:45:03,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:45:03,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:45:03,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:45:03,956 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2019-08-05 10:45:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:06,559 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:45:06,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:45:06,559 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 10:45:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:06,560 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:45:06,560 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:45:06,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=117, Invalid=3305, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:45:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:45:06,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:45:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:45:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:45:06,563 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:45:06,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:06,563 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:45:06,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:45:06,563 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:45:06,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:45:06,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:06,564 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:45:06,564 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:06,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:06,564 INFO L82 PathProgramCache]: Analyzing trace with hash -836059386, now seen corresponding path program 55 times [2019-08-05 10:45:06,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:06,604 WARN L254 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 229 conjunts are in the unsatisfiable core [2019-08-05 10:45:06,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:08,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:08,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:45:08,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:45:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:45:08,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:45:08,436 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2019-08-05 10:45:11,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:11,095 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:45:11,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:45:11,096 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2019-08-05 10:45:11,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:11,097 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:11,097 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:11,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=119, Invalid=3421, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:45:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:45:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:45:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:45:11,099 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:45:11,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:11,100 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:45:11,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:45:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:45:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:45:11,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:11,101 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:45:11,101 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:11,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:11,101 INFO L82 PathProgramCache]: Analyzing trace with hash -148039136, now seen corresponding path program 56 times [2019-08-05 10:45:11,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:11,143 WARN L254 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 233 conjunts are in the unsatisfiable core [2019-08-05 10:45:11,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:13,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:13,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:13,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:45:13,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:45:13,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:45:13,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:45:13,044 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2019-08-05 10:45:15,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:15,747 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:45:15,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:45:15,747 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-08-05 10:45:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:15,748 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:45:15,748 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:45:15,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=121, Invalid=3539, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:45:15,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:45:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:45:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:45:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:45:15,751 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:45:15,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:15,751 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:45:15,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:45:15,751 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:45:15,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:45:15,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:15,752 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:45:15,752 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:15,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:15,752 INFO L82 PathProgramCache]: Analyzing trace with hash -294247866, now seen corresponding path program 57 times [2019-08-05 10:45:15,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:15,795 WARN L254 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-05 10:45:15,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:19,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:19,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:45:19,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:45:19,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:45:19,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:45:19,048 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2019-08-05 10:45:21,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:21,848 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:45:21,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:45:21,848 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2019-08-05 10:45:21,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:21,849 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:45:21,849 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:45:21,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=123, Invalid=3659, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:45:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:45:21,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:45:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:45:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:45:21,852 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:45:21,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:21,853 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:45:21,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:45:21,853 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:45:21,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:45:21,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:21,853 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:45:21,854 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:21,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:21,854 INFO L82 PathProgramCache]: Analyzing trace with hash -531751200, now seen corresponding path program 58 times [2019-08-05 10:45:21,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:21,892 WARN L254 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 241 conjunts are in the unsatisfiable core [2019-08-05 10:45:21,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:23,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:23,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:45:23,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:45:23,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:45:23,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:45:23,905 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2019-08-05 10:45:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:26,810 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:45:26,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:45:26,811 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2019-08-05 10:45:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:26,811 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:45:26,811 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:45:26,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=125, Invalid=3781, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:45:26,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:45:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:45:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:45:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:45:26,814 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:45:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:26,814 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:45:26,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:45:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:45:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:45:26,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:26,815 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:45:26,815 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:26,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:26,815 INFO L82 PathProgramCache]: Analyzing trace with hash 695580038, now seen corresponding path program 59 times [2019-08-05 10:45:26,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:26,849 WARN L254 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 245 conjunts are in the unsatisfiable core [2019-08-05 10:45:26,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:28,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:28,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:45:28,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:45:28,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:45:28,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:45:28,931 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2019-08-05 10:45:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:31,884 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:45:31,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:45:31,885 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2019-08-05 10:45:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:31,886 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:45:31,886 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:45:31,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=127, Invalid=3905, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:45:31,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:45:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:45:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:45:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:45:31,889 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:45:31,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:31,889 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:45:31,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:45:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:45:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:45:31,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:31,890 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:45:31,890 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:31,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:31,890 INFO L82 PathProgramCache]: Analyzing trace with hash 88142752, now seen corresponding path program 60 times [2019-08-05 10:45:31,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:31,939 WARN L254 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-05 10:45:31,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:34,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:34,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:45:34,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:45:34,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:45:34,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:45:34,106 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2019-08-05 10:45:37,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:37,236 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:45:37,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:45:37,236 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2019-08-05 10:45:37,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:37,237 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:45:37,237 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:45:37,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=129, Invalid=4031, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:45:37,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:45:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:45:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:45:37,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:45:37,240 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:45:37,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:37,240 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:45:37,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:45:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:45:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:45:37,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:37,240 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:45:37,241 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:37,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:37,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543930, now seen corresponding path program 61 times [2019-08-05 10:45:37,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:37,276 WARN L254 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 253 conjunts are in the unsatisfiable core [2019-08-05 10:45:37,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:39,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:39,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:45:39,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:45:39,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:45:39,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:45:39,383 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2019-08-05 10:45:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:42,574 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:45:42,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:45:42,575 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2019-08-05 10:45:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:42,576 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:45:42,576 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:45:42,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=131, Invalid=4159, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:45:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:45:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:45:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:45:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:45:42,578 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:45:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:42,578 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:45:42,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:45:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:45:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:45:42,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:42,579 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:45:42,579 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:42,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:42,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223520, now seen corresponding path program 62 times [2019-08-05 10:45:42,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:42,618 WARN L254 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 257 conjunts are in the unsatisfiable core [2019-08-05 10:45:42,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:44,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:44,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:45:44,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:45:44,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:45:44,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:45:44,859 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2019-08-05 10:45:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:48,220 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:45:48,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:45:48,220 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2019-08-05 10:45:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:48,221 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:45:48,221 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:45:48,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=133, Invalid=4289, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:45:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:45:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:45:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:45:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:45:48,224 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:45:48,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:48,224 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:45:48,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:45:48,225 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:45:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:45:48,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:48,225 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:45:48,225 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:48,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:48,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774598, now seen corresponding path program 63 times [2019-08-05 10:45:48,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:48,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-05 10:45:48,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:50,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:50,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:45:50,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:45:50,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:45:50,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:45:50,535 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2019-08-05 10:45:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:53,971 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:45:53,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:45:53,972 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2019-08-05 10:45:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:53,972 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:45:53,973 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:45:53,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=135, Invalid=4421, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:45:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:45:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:45:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:45:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:45:53,976 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:45:53,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:53,976 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:45:53,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:45:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:45:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:45:53,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:53,977 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:45:53,977 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:53,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:53,977 INFO L82 PathProgramCache]: Analyzing trace with hash -892596960, now seen corresponding path program 64 times [2019-08-05 10:45:53,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:54,030 WARN L254 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 265 conjunts are in the unsatisfiable core [2019-08-05 10:45:54,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:56,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:56,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:45:56,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:45:56,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:45:56,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:45:56,402 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2019-08-05 10:45:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:59,882 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:45:59,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:45:59,882 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2019-08-05 10:45:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:59,883 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:45:59,883 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:45:59,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=137, Invalid=4555, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:45:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:45:59,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:45:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:45:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:45:59,886 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:45:59,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:59,886 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:45:59,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:45:59,886 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:45:59,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:45:59,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:59,887 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:45:59,887 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703930, now seen corresponding path program 65 times [2019-08-05 10:45:59,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:59,931 WARN L254 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 269 conjunts are in the unsatisfiable core [2019-08-05 10:45:59,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:02,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:02,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:46:02,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:46:02,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:46:02,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:46:02,461 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2019-08-05 10:46:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:05,950 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:46:05,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:46:05,950 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2019-08-05 10:46:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:05,951 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:46:05,951 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:46:05,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=139, Invalid=4691, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:46:05,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:46:05,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:46:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:46:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:46:05,954 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:46:05,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:05,954 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:46:05,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:46:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:46:05,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:46:05,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:05,955 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:46:05,955 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:05,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:05,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718368, now seen corresponding path program 66 times [2019-08-05 10:46:05,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:05,993 WARN L254 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-05 10:46:05,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:08,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:08,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:46:08,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:46:08,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:46:08,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:46:08,744 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2019-08-05 10:46:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:12,425 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:46:12,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:46:12,426 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2019-08-05 10:46:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:12,427 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:46:12,427 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:46:12,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=141, Invalid=4829, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:46:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:46:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:46:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:46:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:46:12,429 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:46:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:12,430 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:46:12,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:46:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:46:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:46:12,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:12,430 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:46:12,431 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438202, now seen corresponding path program 67 times [2019-08-05 10:46:12,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:12,476 WARN L254 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 277 conjunts are in the unsatisfiable core [2019-08-05 10:46:12,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:15,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:15,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:46:15,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:46:15,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:46:15,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:46:15,238 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2019-08-05 10:46:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:19,061 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:46:19,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:46:19,062 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2019-08-05 10:46:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:19,063 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:46:19,063 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:46:19,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=143, Invalid=4969, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:46:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:46:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:46:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:46:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:46:19,066 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:46:19,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:19,066 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:46:19,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:46:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:46:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:46:19,067 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:19,067 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:46:19,067 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:19,067 INFO L82 PathProgramCache]: Analyzing trace with hash 976119456, now seen corresponding path program 68 times [2019-08-05 10:46:19,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:19,109 WARN L254 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 281 conjunts are in the unsatisfiable core [2019-08-05 10:46:19,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:21,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:21,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:46:21,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:46:21,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:46:21,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:46:21,788 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2019-08-05 10:46:25,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:25,661 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:46:25,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:46:25,662 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2019-08-05 10:46:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:25,663 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:46:25,663 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:46:25,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=145, Invalid=5111, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:46:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:46:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:46:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:46:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:46:25,666 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:46:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:25,666 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:46:25,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:46:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:46:25,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:46:25,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:25,667 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:46:25,667 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:25,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:25,667 INFO L82 PathProgramCache]: Analyzing trace with hash 194930118, now seen corresponding path program 69 times [2019-08-05 10:46:25,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:25,719 WARN L254 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-05 10:46:25,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:28,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:28,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:46:28,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:46:28,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:46:28,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:46:28,662 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2019-08-05 10:46:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:32,689 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:46:32,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:46:32,690 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2019-08-05 10:46:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:32,691 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:46:32,691 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:46:32,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=147, Invalid=5255, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:46:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:46:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:46:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:46:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:46:32,695 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:46:32,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:32,695 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:46:32,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:46:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:46:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:46:32,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:32,696 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:46:32,696 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:32,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864416, now seen corresponding path program 70 times [2019-08-05 10:46:32,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:32,770 WARN L254 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 289 conjunts are in the unsatisfiable core [2019-08-05 10:46:32,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:35,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:35,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:46:35,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:46:35,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:46:35,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:46:35,714 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2019-08-05 10:46:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:40,734 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:46:40,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:46:40,735 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2019-08-05 10:46:40,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:40,736 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:46:40,736 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:46:40,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=149, Invalid=5401, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:46:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:46:40,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:46:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:46:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:46:40,739 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:46:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:40,740 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:46:40,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:46:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:46:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:46:40,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:40,741 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:46:40,741 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:40,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:40,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779898, now seen corresponding path program 71 times [2019-08-05 10:46:40,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:40,797 WARN L254 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 293 conjunts are in the unsatisfiable core [2019-08-05 10:46:40,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:43,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:43,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:46:43,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:46:43,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:46:43,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:46:43,801 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2019-08-05 10:46:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:48,027 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:46:48,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:46:48,028 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2019-08-05 10:46:48,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:48,028 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:46:48,028 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:46:48,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=151, Invalid=5549, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:46:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:46:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:46:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:46:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:46:48,031 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:46:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:48,031 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:46:48,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:46:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:46:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:46:48,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:48,032 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:46:48,032 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:48,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:48,033 INFO L82 PathProgramCache]: Analyzing trace with hash 365428768, now seen corresponding path program 72 times [2019-08-05 10:46:48,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:48,110 WARN L254 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-05 10:46:48,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:51,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:51,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:46:51,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:46:51,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:46:51,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:46:51,614 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2019-08-05 10:46:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:56,019 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:46:56,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:46:56,019 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2019-08-05 10:46:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:56,020 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:46:56,020 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:46:56,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=153, Invalid=5699, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:46:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:46:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:46:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:46:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:46:56,023 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:46:56,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:56,024 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:46:56,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:46:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:46:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:46:56,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:56,025 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:46:56,025 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:56,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612026, now seen corresponding path program 73 times [2019-08-05 10:46:56,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:56,120 WARN L254 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 301 conjunts are in the unsatisfiable core [2019-08-05 10:46:56,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:59,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:59,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:46:59,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:46:59,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:46:59,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:46:59,544 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2019-08-05 10:47:04,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:04,034 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:47:04,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:47:04,035 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2019-08-05 10:47:04,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:04,036 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:47:04,036 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:47:04,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=155, Invalid=5851, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:47:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:47:04,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:47:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:47:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:47:04,039 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:47:04,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:04,039 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:47:04,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:47:04,039 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:47:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:47:04,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:04,040 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:47:04,040 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:04,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334496, now seen corresponding path program 74 times [2019-08-05 10:47:04,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:04,095 WARN L254 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 305 conjunts are in the unsatisfiable core [2019-08-05 10:47:04,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:07,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:07,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:47:07,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:47:07,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:47:07,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:47:07,624 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2019-08-05 10:47:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:12,195 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:47:12,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:47:12,196 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2019-08-05 10:47:12,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:12,197 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:47:12,197 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:47:12,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=157, Invalid=6005, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:47:12,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:47:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:47:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:47:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:47:12,199 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:47:12,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:12,200 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:47:12,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:47:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:47:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:47:12,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:12,200 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:47:12,201 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:12,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:12,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600250, now seen corresponding path program 75 times [2019-08-05 10:47:12,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:12,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 309 conjunts are in the unsatisfiable core [2019-08-05 10:47:12,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:18,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:18,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:47:18,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:47:18,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:47:18,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:47:18,142 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2019-08-05 10:47:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:22,795 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:47:22,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:47:22,796 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2019-08-05 10:47:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:22,796 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:47:22,797 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:47:22,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=159, Invalid=6161, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:47:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:47:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:47:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:47:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:47:22,800 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:47:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:22,800 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:47:22,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:47:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:47:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:47:22,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:22,801 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:47:22,801 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:22,801 INFO L82 PathProgramCache]: Analyzing trace with hash -268904032, now seen corresponding path program 76 times [2019-08-05 10:47:22,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:22,859 WARN L254 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 313 conjunts are in the unsatisfiable core [2019-08-05 10:47:22,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:26,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:26,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:47:26,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:47:26,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:47:26,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:47:26,333 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2019-08-05 10:47:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:31,164 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:47:31,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:47:31,164 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2019-08-05 10:47:31,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:31,165 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:47:31,165 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:47:31,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=161, Invalid=6319, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:47:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:47:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:47:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:47:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:47:31,168 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:47:31,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:31,168 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:47:31,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:47:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:47:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:47:31,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:31,169 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:47:31,170 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:31,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:31,170 INFO L82 PathProgramCache]: Analyzing trace with hash 253907654, now seen corresponding path program 77 times [2019-08-05 10:47:31,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:31,237 WARN L254 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 317 conjunts are in the unsatisfiable core [2019-08-05 10:47:31,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:47:34,492 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:47:34,492 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:47:34,496 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:47:34,496 INFO L202 PluginConnector]: Adding new model INT_anubhav.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:47:34 BoogieIcfgContainer [2019-08-05 10:47:34,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:47:34,499 INFO L168 Benchmark]: Toolchain (without parser) took 250807.82 ms. Allocated memory was 141.0 MB in the beginning and 251.7 MB in the end (delta: 110.6 MB). Free memory was 109.5 MB in the beginning and 42.7 MB in the end (delta: 66.8 MB). Peak memory consumption was 177.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:34,500 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 110.6 MB in the beginning and 110.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:47:34,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.81 ms. Allocated memory is still 141.0 MB. Free memory was 109.3 MB in the beginning and 107.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:34,501 INFO L168 Benchmark]: Boogie Preprocessor took 21.35 ms. Allocated memory is still 141.0 MB. Free memory was 107.4 MB in the beginning and 106.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:34,501 INFO L168 Benchmark]: RCFGBuilder took 345.13 ms. Allocated memory is still 141.0 MB. Free memory was 106.3 MB in the beginning and 97.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:34,502 INFO L168 Benchmark]: TraceAbstraction took 250401.61 ms. Allocated memory was 141.0 MB in the beginning and 251.7 MB in the end (delta: 110.6 MB). Free memory was 96.9 MB in the beginning and 42.7 MB in the end (delta: 54.2 MB). Peak memory consumption was 164.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:34,505 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 110.6 MB in the beginning and 110.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.81 ms. Allocated memory is still 141.0 MB. Free memory was 109.3 MB in the beginning and 107.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.35 ms. Allocated memory is still 141.0 MB. Free memory was 107.4 MB in the beginning and 106.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 345.13 ms. Allocated memory is still 141.0 MB. Free memory was 106.3 MB in the beginning and 97.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250401.61 ms. Allocated memory was 141.0 MB in the beginning and 251.7 MB in the end (delta: 110.6 MB). Free memory was 96.9 MB in the beginning and 42.7 MB in the end (delta: 54.2 MB). Peak memory consumption was 164.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 77,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 250.3s OverallTime, 78 OverallIterations, 77 TraceHistogramMax, 135.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 154 SDtfs, 79 SDslu, 77 SDs, 0 SdLazy, 167401 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 111.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3157 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 109.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=77, 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.1s AutomataMinimizationTime, 77 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 109.4s InterpolantComputationTime, 3157 NumberOfCodeBlocks, 3157 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 3080 ConstructedInterpolants, 0 QuantifiedInterpolants, 1755134 SizeOfPredicates, 77 NumberOfNonLiveVariables, 15477 ConjunctsInSsa, 12397 ConjunctsInUnsatCore, 77 InterpolantComputations, 1 PerfectInterpolantSequences, 0/76076 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown