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/real-life/RailwayCrossing.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:13:18,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:13:18,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:13:18,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:13:18,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:13:18,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:13:18,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:13:18,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:13:18,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:13:18,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:13:18,960 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:13:18,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:13:18,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:13:18,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:13:18,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:13:18,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:13:18,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:13:18,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:13:18,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:13:18,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:13:18,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:13:18,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:13:18,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:13:18,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:13:18,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:13:18,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:13:18,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:13:18,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:13:18,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:13:18,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:13:18,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:13:18,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:13:18,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:13:18,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:13:18,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:13:18,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:13:18,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:13:18,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:13:18,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:13:18,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:13:18,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:13:19,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:13:19,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:13:19,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:13:19,046 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:13:19,047 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:13:19,047 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing.bpl [2019-08-05 10:13:19,048 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing.bpl' [2019-08-05 10:13:19,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:13:19,079 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:13:19,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:13:19,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:13:19,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:13:19,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:19" (1/1) ... [2019-08-05 10:13:19,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:19" (1/1) ... [2019-08-05 10:13:19,110 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:13:19,110 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:13:19,110 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:13:19,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:13:19,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:13:19,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:13:19,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:13:19,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:19" (1/1) ... [2019-08-05 10:13:19,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:19" (1/1) ... [2019-08-05 10:13:19,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:19" (1/1) ... [2019-08-05 10:13:19,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:19" (1/1) ... [2019-08-05 10:13:19,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:19" (1/1) ... [2019-08-05 10:13:19,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:19" (1/1) ... [2019-08-05 10:13:19,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:19" (1/1) ... [2019-08-05 10:13:19,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:13:19,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:13:19,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:13:19,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:13:19,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:19" (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:13:19,199 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2019-08-05 10:13:19,200 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2019-08-05 10:13:19,200 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2019-08-05 10:13:19,696 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:13:19,696 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:13:19,698 INFO L202 PluginConnector]: Adding new model RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:13:19 BoogieIcfgContainer [2019-08-05 10:13:19,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:13:19,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:13:19,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:13:19,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:13:19,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:19" (1/2) ... [2019-08-05 10:13:19,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d447e75 and model type RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:13:19, skipping insertion in model container [2019-08-05 10:13:19,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:13:19" (2/2) ... [2019-08-05 10:13:19,706 INFO L109 eAbstractionObserver]: Analyzing ICFG RailwayCrossing.bpl [2019-08-05 10:13:19,714 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:13:19,720 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:13:19,733 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:13:19,757 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:13:19,758 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:13:19,758 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:13:19,758 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:13:19,758 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:13:19,758 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:13:19,758 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:13:19,759 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:13:19,759 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:13:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:13:19,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:13:19,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:19,781 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:13:19,783 INFO L418 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:19,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:19,788 INFO L82 PathProgramCache]: Analyzing trace with hash 30496, now seen corresponding path program 1 times [2019-08-05 10:13:19,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:19,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:13:19,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:19,988 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:13:19,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:19,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:13:19,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:20,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:20,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:20,008 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:13:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:20,037 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:13:20,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:20,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:13:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:20,049 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:13:20,050 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:13:20,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:13:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:13:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:13:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:13:20,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:13:20,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:20,088 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:13:20,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:13:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:13:20,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:20,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:13:20,089 INFO L418 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:20,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:20,090 INFO L82 PathProgramCache]: Analyzing trace with hash 955939, now seen corresponding path program 1 times [2019-08-05 10:13:20,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:20,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:20,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:20,369 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:13:20,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:20,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:13:20,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:13:20,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:13:20,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:20,373 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:13:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:20,440 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:13:20,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:13:20,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:13:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:20,442 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:13:20,442 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:13:20,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:20,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:13:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:13:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:13:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:13:20,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:13:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:20,446 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:13:20,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:13:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:13:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:13:20,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:20,447 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:13:20,448 INFO L418 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:20,448 INFO L82 PathProgramCache]: Analyzing trace with hash 29644672, now seen corresponding path program 2 times [2019-08-05 10:13:20,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:20,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:20,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:20,686 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:13:20,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:20,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:13:20,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:20,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:20,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:20,688 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:13:20,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:20,762 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:13:20,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:13:20,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:13:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:20,763 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:13:20,763 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:13:20,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:13:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:13:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:13:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:13:20,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:13:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:20,766 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:13:20,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:13:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:13:20,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:20,767 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:13:20,768 INFO L418 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:20,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:20,768 INFO L82 PathProgramCache]: Analyzing trace with hash 918995395, now seen corresponding path program 3 times [2019-08-05 10:13:20,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:20,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:13:20,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:21,055 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:13:21,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:21,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:13:21,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:13:21,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:13:21,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:21,057 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:13:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:21,085 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:13:21,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:21,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:13:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:21,086 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:13:21,086 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:13:21,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:13:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:13:21,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:13:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:13:21,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:13:21,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:21,089 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:13:21,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:13:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:13:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:13:21,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:21,090 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:13:21,091 INFO L418 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:21,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:21,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1575903264, now seen corresponding path program 4 times [2019-08-05 10:13:21,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:21,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:13:21,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:21,420 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:13:21,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:21,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:21,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:21,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:21,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:21,422 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:13:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:21,534 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:13:21,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:13:21,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:13:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:21,535 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:13:21,536 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:13:21,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:13:21,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:13:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:13:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:13:21,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:13:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:21,539 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:13:21,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:13:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:13:21,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:21,540 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:13:21,540 INFO L418 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:21,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1608350365, now seen corresponding path program 5 times [2019-08-05 10:13:21,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:21,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:13:21,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:21,871 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:13:21,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:21,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:21,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:21,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:21,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:21,872 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:13:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:21,894 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:13:21,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:13:21,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:13:21,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:21,896 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:13:21,896 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:13:21,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:21,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:13:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:13:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:13:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:13:21,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:13:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:21,899 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:13:21,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:13:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:13:21,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:21,900 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:13:21,900 INFO L418 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:21,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:21,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1680756800, now seen corresponding path program 6 times [2019-08-05 10:13:21,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:21,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:13:21,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:22,434 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:13:22,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:22,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:13:22,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:22,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:22,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:22,436 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:13:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:22,473 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:13:22,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:13:22,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:13:22,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:22,475 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:13:22,475 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:13:22,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:13:22,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:13:22,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:13:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:13:22,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:13:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:22,479 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:13:22,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:13:22,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:13:22,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:22,480 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:13:22,480 INFO L418 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:22,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:22,481 INFO L82 PathProgramCache]: Analyzing trace with hash 563863811, now seen corresponding path program 7 times [2019-08-05 10:13:22,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:22,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:13:22,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:22,845 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:13:22,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:22,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:13:22,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:13:22,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:13:22,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:13:22,847 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:13:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:22,889 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:13:22,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:13:22,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:13:22,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:22,891 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:13:22,891 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:13:22,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:13:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:13:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:13:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:13:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:13:22,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:13:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:22,894 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:13:22,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:13:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:13:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:13:22,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:22,895 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:13:22,896 INFO L418 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash 299919520, now seen corresponding path program 8 times [2019-08-05 10:13:22,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:22,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:13:22,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:23,161 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:13:23,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:23,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:13:23,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:13:23,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:13:23,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:13:23,163 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:13:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:23,206 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:13:23,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:13:23,207 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:13:23,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:23,207 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:13:23,208 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:13:23,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:13:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:13:23,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:13:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:13:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:13:23,211 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:13:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:23,212 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:13:23,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:13:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:13:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:13:23,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:23,213 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:13:23,213 INFO L418 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:23,214 INFO L82 PathProgramCache]: Analyzing trace with hash 707581091, now seen corresponding path program 9 times [2019-08-05 10:13:23,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:23,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:13:23,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:23,578 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:13:23,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:23,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:13:23,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:13:23,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:13:23,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:13:23,580 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:13:23,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:23,634 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:13:23,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:13:23,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:13:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:23,635 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:13:23,635 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:13:23,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:13:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:13:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:13:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:13:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:13:23,639 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:13:23,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:23,639 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:13:23,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:13:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:13:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:23,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:23,640 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:13:23,640 INFO L418 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:23,641 INFO L82 PathProgramCache]: Analyzing trace with hash 460187904, now seen corresponding path program 10 times [2019-08-05 10:13:23,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:23,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:13:23,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:24,313 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:13:24,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:24,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:13:24,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:13:24,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:13:24,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:13:24,316 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:13:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:24,339 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:13:24,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:13:24,340 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:13:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:24,341 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:13:24,341 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:13:24,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:13:24,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:13:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:13:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:13:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:13:24,345 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:13:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:24,345 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:13:24,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:13:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:13:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:13:24,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:24,346 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:13:24,346 INFO L418 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:24,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:24,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1380933699, now seen corresponding path program 11 times [2019-08-05 10:13:24,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:24,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:13:24,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:24,883 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:13:24,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:24,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:13:24,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:13:24,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:13:24,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:13:24,886 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:13:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:24,939 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:13:24,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:13:24,940 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:13:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:24,941 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:13:24,941 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:13:24,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:13:24,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:13:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:13:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:13:24,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:13:24,945 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:13:24,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:24,945 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:13:24,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:13:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:13:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:13:24,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:24,947 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:13:24,947 INFO L418 AbstractCegarLoop]: === Iteration 13 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:24,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:24,947 INFO L82 PathProgramCache]: Analyzing trace with hash -140717728, now seen corresponding path program 12 times [2019-08-05 10:13:24,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:24,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:13:24,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:25,264 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:13:25,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:25,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:13:25,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:13:25,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:13:25,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:13:25,266 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:13:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:25,302 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:13:25,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:13:25,303 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:13:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:25,304 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:13:25,304 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:13:25,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:13:25,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:13:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:13:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:13:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:13:25,307 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:13:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:25,308 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:13:25,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:13:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:13:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:13:25,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:25,309 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:13:25,309 INFO L418 AbstractCegarLoop]: === Iteration 14 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:25,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:25,309 INFO L82 PathProgramCache]: Analyzing trace with hash -67271709, now seen corresponding path program 13 times [2019-08-05 10:13:25,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:25,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:13:25,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:25,650 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:13:25,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:25,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:13:25,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:13:25,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:13:25,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:13:25,652 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:13:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:25,689 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:13:25,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:25,690 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:13:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:25,691 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:13:25,691 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:13:25,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:13:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:13:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:13:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:13:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:13:25,695 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:13:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:25,696 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:13:25,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:13:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:13:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:13:25,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:25,696 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:13:25,697 INFO L418 AbstractCegarLoop]: === Iteration 15 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:25,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2085412416, now seen corresponding path program 14 times [2019-08-05 10:13:25,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:25,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:13:25,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:27,495 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:13:27,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:27,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:13:27,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:13:27,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:13:27,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:13:27,497 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:13:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:27,733 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:13:27,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:13:27,735 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:13:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:27,735 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:13:27,735 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:13:27,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:13:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:13:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:13:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:13:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:13:27,741 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:13:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:27,742 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:13:27,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:13:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:13:27,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:27,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:27,743 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:13:27,744 INFO L418 AbstractCegarLoop]: === Iteration 16 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:27,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:27,745 INFO L82 PathProgramCache]: Analyzing trace with hash -223264893, now seen corresponding path program 15 times [2019-08-05 10:13:27,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:27,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:13:27,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:28,232 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:13:28,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:28,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:13:28,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:13:28,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:13:28,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:13:28,234 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:13:28,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:28,296 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:13:28,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:13:28,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:13:28,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:28,297 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:13:28,298 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:13:28,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:13:28,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:13:28,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:13:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:13:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:13:28,302 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:13:28,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:28,302 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:13:28,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:13:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:13:28,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:13:28,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:28,304 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:13:28,304 INFO L418 AbstractCegarLoop]: === Iteration 17 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:28,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:28,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1668733472, now seen corresponding path program 16 times [2019-08-05 10:13:28,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:28,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:13:28,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:28,776 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:13:28,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:28,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:13:28,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:13:28,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:13:28,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:13:28,778 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:13:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:28,821 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:13:28,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:13:28,822 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:13:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:28,823 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:13:28,823 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:13:28,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:13:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:13:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:13:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:13:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:13:28,827 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:13:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:28,827 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:13:28,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:13:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:13:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:13:28,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:28,828 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:13:28,828 INFO L418 AbstractCegarLoop]: === Iteration 18 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:28,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:28,828 INFO L82 PathProgramCache]: Analyzing trace with hash 191140643, now seen corresponding path program 17 times [2019-08-05 10:13:28,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:28,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:13:28,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:29,476 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:13:29,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:29,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:13:29,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:13:29,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:13:29,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:29,478 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:13:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:29,521 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:13:29,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:13:29,525 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:13:29,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:29,526 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:13:29,526 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:13:29,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:13:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:13:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:13:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:13:29,531 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:13:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:29,531 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:13:29,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:13:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:13:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:13:29,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:29,532 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:13:29,532 INFO L418 AbstractCegarLoop]: === Iteration 19 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:29,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1630403200, now seen corresponding path program 18 times [2019-08-05 10:13:29,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:29,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:13:29,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:29,946 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:13:29,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:29,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:13:29,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:13:29,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:13:29,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:13:29,948 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:13:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:29,997 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:13:29,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:13:29,997 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:13:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:29,998 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:13:29,999 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:13:30,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:13:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:13:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:13:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:13:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:13:30,003 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:13:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:30,003 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:13:30,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:13:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:13:30,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:13:30,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:30,004 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:13:30,004 INFO L418 AbstractCegarLoop]: === Iteration 20 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:30,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:30,005 INFO L82 PathProgramCache]: Analyzing trace with hash -997097789, now seen corresponding path program 19 times [2019-08-05 10:13:30,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:30,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:13:30,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:30,701 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:13:30,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:30,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:13:30,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:13:30,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:13:30,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:13:30,703 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:13:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:30,748 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:13:30,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:13:30,749 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:13:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:30,750 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:13:30,750 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:13:30,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:13:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:13:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:13:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:13:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:13:30,755 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:13:30,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:30,755 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:13:30,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:13:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:13:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:13:30,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:30,756 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:13:30,757 INFO L418 AbstractCegarLoop]: === Iteration 21 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:30,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:30,757 INFO L82 PathProgramCache]: Analyzing trace with hash -845249824, now seen corresponding path program 20 times [2019-08-05 10:13:30,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:30,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:13:30,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:31,353 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:13:31,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:31,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:13:31,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:13:31,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:13:31,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:13:31,355 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:13:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:31,402 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:13:31,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:13:31,403 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:13:31,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:31,403 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:13:31,404 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:13:31,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:13:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:13:31,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:13:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:13:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:13:31,409 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:13:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:31,409 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:13:31,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:13:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:13:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:13:31,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:31,410 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:13:31,411 INFO L418 AbstractCegarLoop]: === Iteration 22 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:31,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:31,411 INFO L82 PathProgramCache]: Analyzing trace with hash -432930205, now seen corresponding path program 21 times [2019-08-05 10:13:31,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:31,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:13:31,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:32,942 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:13:32,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:32,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:13:32,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:13:32,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:13:32,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:32,945 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:13:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:32,997 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:13:32,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:13:33,000 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:13:33,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:33,000 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:13:33,000 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:13:33,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:13:33,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:13:33,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:13:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:13:33,004 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:13:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:33,004 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:13:33,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:13:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:13:33,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:13:33,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:33,005 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:13:33,006 INFO L418 AbstractCegarLoop]: === Iteration 23 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:33,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:33,006 INFO L82 PathProgramCache]: Analyzing trace with hash -535923904, now seen corresponding path program 22 times [2019-08-05 10:13:33,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:33,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:13:33,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:34,412 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:13:34,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:34,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:13:34,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:13:34,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:13:34,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:13:34,414 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:13:34,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:34,482 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:13:34,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:13:34,483 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:13:34,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:34,483 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:13:34,483 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:13:34,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:13:34,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:13:34,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:13:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:13:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:13:34,487 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:13:34,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:34,487 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:13:34,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:13:34,487 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:13:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:13:34,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:34,488 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:13:34,488 INFO L418 AbstractCegarLoop]: === Iteration 24 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:34,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:34,489 INFO L82 PathProgramCache]: Analyzing trace with hash 566238723, now seen corresponding path program 23 times [2019-08-05 10:13:34,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:34,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:13:34,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:35,236 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:13:35,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:35,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:13:35,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:13:35,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:13:35,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:13:35,238 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:13:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:35,314 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:13:35,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:13:35,315 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:13:35,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:35,315 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:13:35,316 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:13:35,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:13:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:13:35,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:13:35,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:13:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:13:35,320 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:13:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:35,320 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:13:35,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:13:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:13:35,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:13:35,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:35,321 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:13:35,321 INFO L418 AbstractCegarLoop]: === Iteration 25 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:35,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:35,322 INFO L82 PathProgramCache]: Analyzing trace with hash 373541792, now seen corresponding path program 24 times [2019-08-05 10:13:35,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:35,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:13:35,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:36,229 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:13:36,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:36,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:13:36,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:13:36,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:13:36,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:13:36,230 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:13:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:36,305 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:13:36,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:13:36,306 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:13:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:36,307 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:13:36,307 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:13:36,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:13:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:13:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:13:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:13:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:13:36,311 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:13:36,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:36,312 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:13:36,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:13:36,312 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:13:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:13:36,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:36,313 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:13:36,313 INFO L418 AbstractCegarLoop]: === Iteration 26 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:36,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:36,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1305095773, now seen corresponding path program 25 times [2019-08-05 10:13:36,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:36,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:13:36,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:37,014 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:13:37,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:37,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:13:37,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:13:37,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:13:37,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:37,015 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:13:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:37,072 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:13:37,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:13:37,073 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:13:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:37,074 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:13:37,074 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:13:37,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:37,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:13:37,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:13:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:13:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:13:37,077 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:13:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:37,077 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:13:37,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:13:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:13:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:13:37,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:37,078 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:13:37,078 INFO L418 AbstractCegarLoop]: === Iteration 27 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:37,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:37,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1803252736, now seen corresponding path program 26 times [2019-08-05 10:13:37,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:37,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:13:37,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:40,098 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:13:40,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:40,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:13:40,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:13:40,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:13:40,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:13:40,100 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:13:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:40,213 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:13:40,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:13:40,214 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:13:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:40,214 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:13:40,215 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:13:40,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:13:40,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:13:40,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:13:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:13:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:13:40,220 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:13:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:40,220 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:13:40,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:13:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:13:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:13:40,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:40,222 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:13:40,222 INFO L418 AbstractCegarLoop]: === Iteration 28 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:40,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:40,223 INFO L82 PathProgramCache]: Analyzing trace with hash -66249405, now seen corresponding path program 27 times [2019-08-05 10:13:40,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:40,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:13:40,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:40,847 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:13:40,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:40,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:13:40,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:13:40,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:13:40,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:13:40,849 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:13:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:40,987 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:13:40,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:13:40,988 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:13:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:40,989 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:13:40,989 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:13:40,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:13:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:13:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:13:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:13:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:13:40,993 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:13:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:40,993 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:13:40,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:13:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:13:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:13:40,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:40,994 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:13:40,994 INFO L418 AbstractCegarLoop]: === Iteration 29 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:40,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2053720992, now seen corresponding path program 28 times [2019-08-05 10:13:40,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:41,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:13:41,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:41,959 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:13:41,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:41,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:13:41,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:13:41,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:13:41,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:13:41,961 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:13:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:42,072 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:13:42,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:13:42,072 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:13:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:42,073 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:13:42,073 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:13:42,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:13:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:13:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:13:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:13:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:13:42,077 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:13:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:42,077 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:13:42,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:13:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:13:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:13:42,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:42,078 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:13:42,078 INFO L418 AbstractCegarLoop]: === Iteration 30 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:42,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:42,078 INFO L82 PathProgramCache]: Analyzing trace with hash 759169251, now seen corresponding path program 29 times [2019-08-05 10:13:42,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:42,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:13:42,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:42,861 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:13:42,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:42,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:13:42,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:13:42,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:13:42,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:13:42,862 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:13:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:42,979 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:13:42,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:13:42,979 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:13:42,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:42,980 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:13:42,980 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:13:42,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:13:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:13:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:13:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:13:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:13:42,984 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:13:42,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:42,985 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:13:42,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:13:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:13:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:13:42,985 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:42,985 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:13:42,986 INFO L418 AbstractCegarLoop]: === Iteration 31 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:42,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2059420864, now seen corresponding path program 30 times [2019-08-05 10:13:42,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:43,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:13:43,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:43,862 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:13:43,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:43,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:13:43,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:13:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:13:43,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:13:43,864 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:13:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:43,924 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:13:43,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:13:43,924 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:13:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:43,925 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:13:43,925 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:13:43,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:13:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:13:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:13:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:13:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:13:43,928 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:13:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:43,929 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:13:43,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:13:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:13:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:13:43,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:43,930 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:13:43,930 INFO L418 AbstractCegarLoop]: === Iteration 32 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:43,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:43,930 INFO L82 PathProgramCache]: Analyzing trace with hash -582452093, now seen corresponding path program 31 times [2019-08-05 10:13:43,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:43,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:13:43,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:44,784 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:13:44,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:44,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:13:44,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:13:44,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:13:44,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:44,786 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:13:44,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:44,852 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:13:44,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:13:44,853 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:13:44,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:44,853 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:13:44,854 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:13:44,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:44,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:13:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:13:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:13:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:13:44,858 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:13:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:44,858 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:13:44,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:13:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:13:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:13:44,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:44,859 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:13:44,859 INFO L418 AbstractCegarLoop]: === Iteration 33 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:44,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:44,859 INFO L82 PathProgramCache]: Analyzing trace with hash -876135136, now seen corresponding path program 32 times [2019-08-05 10:13:44,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:44,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:13:44,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:45,709 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:13:45,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:45,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:13:45,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:13:45,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:13:45,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:45,711 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:13:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:45,770 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:13:45,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:13:45,771 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:13:45,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:45,771 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:13:45,772 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:13:45,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:13:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:13:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:13:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:13:45,775 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:13:45,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:45,775 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:13:45,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:13:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:13:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:13:45,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:45,776 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:13:45,776 INFO L418 AbstractCegarLoop]: === Iteration 34 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:45,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:45,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1390374877, now seen corresponding path program 33 times [2019-08-05 10:13:45,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:45,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:13:45,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:46,915 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:13:46,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:46,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:13:46,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:13:46,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:13:46,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:13:46,916 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:13:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:46,984 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:13:46,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:13:46,984 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:13:46,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:46,985 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:13:46,985 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:13:46,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:13:46,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:13:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:13:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:13:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:13:46,989 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:13:46,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:46,989 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:13:46,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:13:46,989 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:13:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:13:46,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:46,990 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:13:46,990 INFO L418 AbstractCegarLoop]: === Iteration 35 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:46,990 INFO L82 PathProgramCache]: Analyzing trace with hash -151937664, now seen corresponding path program 34 times [2019-08-05 10:13:46,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:47,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:13:47,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:48,319 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:13:48,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:48,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:13:48,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:13:48,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:13:48,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:13:48,321 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:13:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:48,388 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:13:48,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:13:48,388 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:13:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:48,389 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:13:48,389 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:13:48,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:13:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:13:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:13:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:13:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:13:48,392 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:13:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:48,393 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:13:48,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:13:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:13:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:13:48,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:48,394 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:13:48,394 INFO L418 AbstractCegarLoop]: === Iteration 36 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:48,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:48,394 INFO L82 PathProgramCache]: Analyzing trace with hash -415089725, now seen corresponding path program 35 times [2019-08-05 10:13:48,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:48,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:13:48,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:49,350 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:13:49,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:49,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:13:49,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:13:49,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:13:49,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:13:49,352 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:13:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:49,434 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:13:49,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:13:49,434 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:13:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:49,435 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:13:49,435 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:13:49,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:13:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:13:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:13:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:13:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:13:49,438 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:13:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:49,439 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:13:49,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:13:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:13:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:13:49,439 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:49,439 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:13:49,439 INFO L418 AbstractCegarLoop]: === Iteration 37 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:49,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:49,440 INFO L82 PathProgramCache]: Analyzing trace with hash 17130976, now seen corresponding path program 36 times [2019-08-05 10:13:49,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:49,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:13:49,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:50,830 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:13:50,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:50,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:13:50,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:13:50,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:13:50,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:13:50,832 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:13:50,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:50,898 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:13:50,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:13:50,899 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:13:50,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:50,899 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:13:50,899 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:13:50,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:13:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:13:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:13:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:13:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:13:50,903 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:13:50,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:50,903 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:13:50,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:13:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:13:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:13:50,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:50,904 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:13:50,904 INFO L418 AbstractCegarLoop]: === Iteration 38 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:50,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:50,905 INFO L82 PathProgramCache]: Analyzing trace with hash 531070819, now seen corresponding path program 37 times [2019-08-05 10:13:50,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:50,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:13:50,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:52,196 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:13:52,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:52,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:13:52,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:13:52,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:13:52,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:13:52,198 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:13:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:52,289 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:13:52,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:13:52,290 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:13:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:52,291 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:13:52,291 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:13:52,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:13:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:13:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:13:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:13:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:13:52,294 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:13:52,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:52,295 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:13:52,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:13:52,295 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:13:52,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:13:52,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:52,296 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:13:52,296 INFO L418 AbstractCegarLoop]: === Iteration 39 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:52,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:52,296 INFO L82 PathProgramCache]: Analyzing trace with hash -716663232, now seen corresponding path program 38 times [2019-08-05 10:13:52,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:52,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:13:52,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:54,054 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:13:54,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:54,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:13:54,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:13:54,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:13:54,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:13:54,056 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:13:54,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:54,131 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:13:54,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:13:54,131 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:13:54,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:54,132 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:13:54,132 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:13:54,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:13:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:13:54,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:13:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:13:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:13:54,136 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:13:54,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:54,136 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:13:54,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:13:54,136 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:13:54,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:13:54,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:54,137 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:13:54,137 INFO L418 AbstractCegarLoop]: === Iteration 40 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:54,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:54,137 INFO L82 PathProgramCache]: Analyzing trace with hash -741713149, now seen corresponding path program 39 times [2019-08-05 10:13:54,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:54,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:13:54,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:55,231 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:13:55,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:55,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:13:55,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:13:55,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:13:55,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:13:55,232 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:13:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:55,309 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:13:55,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:13:55,309 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:13:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:55,310 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:13:55,310 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:13:55,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:13:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:13:55,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:13:55,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:13:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:13:55,313 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:13:55,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:55,314 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:13:55,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:13:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:13:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:13:55,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:55,315 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:13:55,315 INFO L418 AbstractCegarLoop]: === Iteration 41 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:55,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:55,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1518260576, now seen corresponding path program 40 times [2019-08-05 10:13:55,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:55,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:13:55,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:56,671 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:13:56,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:56,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:13:56,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:13:56,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:13:56,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:13:56,672 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:13:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:56,814 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:13:56,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:13:56,814 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:13:56,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:56,815 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:13:56,815 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:13:56,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:13:56,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:13:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:13:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:13:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:13:56,819 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:13:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:56,819 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:13:56,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:13:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:13:56,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:13:56,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:56,820 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:13:56,820 INFO L418 AbstractCegarLoop]: === Iteration 42 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:56,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:56,820 INFO L82 PathProgramCache]: Analyzing trace with hash 178572963, now seen corresponding path program 41 times [2019-08-05 10:13:56,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:56,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:13:56,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:58,267 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:13:58,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:58,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:13:58,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:13:58,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:13:58,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:13:58,269 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:13:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:58,348 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:13:58,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:13:58,348 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:13:58,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:58,349 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:13:58,349 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:13:58,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:13:58,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:13:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:13:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:13:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:13:58,352 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:13:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:58,352 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:13:58,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:13:58,352 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:13:58,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:13:58,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:58,353 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:13:58,353 INFO L418 AbstractCegarLoop]: === Iteration 43 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:58,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:58,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1240805120, now seen corresponding path program 42 times [2019-08-05 10:13:58,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:58,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:13:58,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:59,599 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:13:59,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:59,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:13:59,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:13:59,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:13:59,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:13:59,601 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:13:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:59,678 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:13:59,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:13:59,679 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:13:59,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:59,679 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:13:59,680 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:13:59,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:13:59,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:13:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:13:59,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:13:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:13:59,683 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:13:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:59,683 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:13:59,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:13:59,683 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:13:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:13:59,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:59,684 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:13:59,684 INFO L418 AbstractCegarLoop]: === Iteration 44 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:59,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:59,684 INFO L82 PathProgramCache]: Analyzing trace with hash -189736381, now seen corresponding path program 43 times [2019-08-05 10:13:59,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:59,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:13:59,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:01,020 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:14:01,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:01,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:14:01,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:14:01,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:14:01,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:14:01,022 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:14:01,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:01,149 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:14:01,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:14:01,150 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:14:01,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:01,151 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:14:01,151 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:14:01,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:14:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:14:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:14:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:14:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:14:01,153 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:14:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:01,153 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:14:01,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:14:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:14:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:14:01,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:01,154 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:14:01,154 INFO L418 AbstractCegarLoop]: === Iteration 45 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:01,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1586849952, now seen corresponding path program 44 times [2019-08-05 10:14:01,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:01,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:14:01,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:02,915 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:14:02,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:02,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:14:02,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:14:02,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:14:02,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:14:02,917 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:14:03,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:03,014 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:14:03,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:14:03,015 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:14:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:03,015 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:14:03,015 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:14:03,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:14:03,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:14:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:14:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:14:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:14:03,018 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:14:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:03,018 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:14:03,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:14:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:14:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:14:03,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:03,019 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:14:03,020 INFO L418 AbstractCegarLoop]: === Iteration 46 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:03,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:03,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1947697693, now seen corresponding path program 45 times [2019-08-05 10:14:03,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:03,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:14:03,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:04,578 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:14:04,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:04,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:14:04,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:14:04,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:14:04,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:14:04,580 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:14:04,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:04,991 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:14:04,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:14:04,992 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:14:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:04,993 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:14:04,993 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:14:04,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:14:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:14:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:14:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:14:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:14:04,996 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:14:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:04,996 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:14:04,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:14:04,996 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:14:04,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:14:04,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:04,997 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:14:04,997 INFO L418 AbstractCegarLoop]: === Iteration 47 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:04,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:04,997 INFO L82 PathProgramCache]: Analyzing trace with hash -249075776, now seen corresponding path program 46 times [2019-08-05 10:14:04,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:05,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:14:05,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:06,574 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:14:06,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:06,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:14:06,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:14:06,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:14:06,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:14:06,575 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:14:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:06,770 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:14:06,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:14:06,770 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:14:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:06,770 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:14:06,771 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:14:06,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:14:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:14:06,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:14:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:14:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:14:06,772 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:14:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:06,773 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:14:06,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:14:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:14:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:14:06,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:06,773 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:14:06,773 INFO L418 AbstractCegarLoop]: === Iteration 48 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:06,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:06,774 INFO L82 PathProgramCache]: Analyzing trace with hash 868596099, now seen corresponding path program 47 times [2019-08-05 10:14:06,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:06,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:14:06,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:08,406 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:14:08,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:08,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:14:08,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:14:08,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:14:08,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:14:08,408 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:14:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:08,493 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:14:08,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:14:08,493 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:14:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:08,494 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:14:08,494 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:14:08,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:14:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:14:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:14:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:14:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:14:08,498 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:14:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:08,498 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:14:08,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:14:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:14:08,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:14:08,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:08,499 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:14:08,499 INFO L418 AbstractCegarLoop]: === Iteration 49 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:08,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:08,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1156685856, now seen corresponding path program 48 times [2019-08-05 10:14:08,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:08,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:14:08,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:10,152 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:14:10,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:10,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:14:10,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:14:10,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:14:10,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:14:10,154 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:14:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:10,256 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:14:10,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:14:10,256 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:14:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:10,257 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:14:10,257 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:14:10,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:14:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:14:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:14:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:14:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:14:10,260 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:14:10,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:10,260 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:14:10,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:14:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:14:10,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:14:10,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:10,261 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:14:10,261 INFO L418 AbstractCegarLoop]: === Iteration 50 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:10,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:10,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1497533731, now seen corresponding path program 49 times [2019-08-05 10:14:10,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:10,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:14:10,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:11,802 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:14:11,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:11,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:14:11,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:14:11,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:14:11,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:14:11,804 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:14:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:11,932 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:14:11,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:14:11,933 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:14:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:11,933 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:14:11,933 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:14:11,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:14:11,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:14:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:14:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:14:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:14:11,936 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:14:11,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:11,936 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:14:11,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:14:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:14:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:14:11,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:11,937 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:14:11,938 INFO L418 AbstractCegarLoop]: === Iteration 51 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:11,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:11,938 INFO L82 PathProgramCache]: Analyzing trace with hash -821084032, now seen corresponding path program 50 times [2019-08-05 10:14:11,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:11,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:14:11,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:13,762 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:14:13,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:13,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:14:13,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:14:13,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:14:13,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:14:13,764 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:14:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:13,863 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:14:13,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:14:13,864 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:14:13,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:13,865 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:14:13,865 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:14:13,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:14:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:14:13,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:14:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:14:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:14:13,867 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:14:13,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:13,868 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:14:13,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:14:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:14:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:14:13,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:13,868 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:14:13,869 INFO L418 AbstractCegarLoop]: === Iteration 52 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:13,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:13,869 INFO L82 PathProgramCache]: Analyzing trace with hash 316209347, now seen corresponding path program 51 times [2019-08-05 10:14:13,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:13,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:14:13,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:15,709 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:14:15,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:15,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:14:15,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:14:15,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:14:15,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:14:15,710 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:14:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:15,839 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:14:15,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:14:15,840 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:14:15,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:15,840 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:14:15,841 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:14:15,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:14:15,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:14:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:14:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:14:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:14:15,844 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:14:15,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:15,845 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:14:15,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:14:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:14:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:14:15,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:15,845 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:14:15,846 INFO L418 AbstractCegarLoop]: === Iteration 53 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:15,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:15,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1212565728, now seen corresponding path program 52 times [2019-08-05 10:14:15,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:15,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:14:15,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:17,904 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:14:17,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:17,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:14:17,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:14:17,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:14:17,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:14:17,906 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:14:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:18,018 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:14:18,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:14:18,019 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:14:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:18,020 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:14:18,020 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:14:18,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:14:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:14:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:14:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:14:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:14:18,024 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:14:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:18,024 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:14:18,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:14:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:14:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:14:18,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:18,025 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:14:18,025 INFO L418 AbstractCegarLoop]: === Iteration 54 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:18,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:18,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1065157533, now seen corresponding path program 53 times [2019-08-05 10:14:18,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:18,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:14:18,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:19,890 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:14:19,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:19,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:14:19,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:14:19,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:14:19,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:14:19,892 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:14:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:19,987 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:14:19,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:14:19,988 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:14:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:19,989 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:14:19,989 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:14:19,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:14:19,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:14:19,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:14:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:14:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:14:19,992 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:14:19,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:19,992 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:14:19,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:14:19,993 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:14:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:14:19,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:19,993 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:14:19,993 INFO L418 AbstractCegarLoop]: === Iteration 55 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:19,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:19,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1339865408, now seen corresponding path program 54 times [2019-08-05 10:14:19,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:20,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:14:20,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:21,784 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:14:21,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:21,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:14:21,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:14:21,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:14:21,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:14:21,785 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:14:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:21,912 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:14:21,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:14:21,913 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:14:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:21,914 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:14:21,914 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:14:21,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:14:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:14:21,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:14:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:14:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:14:21,916 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:14:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:21,916 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:14:21,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:14:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:14:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:14:21,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:21,917 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:14:21,917 INFO L418 AbstractCegarLoop]: === Iteration 56 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:21,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:21,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1413834749, now seen corresponding path program 55 times [2019-08-05 10:14:21,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:21,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:14:21,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:24,025 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:14:24,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:24,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:14:24,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:14:24,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:14:24,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:14:24,026 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:14:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:24,135 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:14:24,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:14:24,136 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:14:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:24,137 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:14:24,137 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:14:24,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:14:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:14:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:14:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:14:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:14:24,141 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:14:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:24,141 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:14:24,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:14:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:14:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:14:24,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:24,142 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:14:24,142 INFO L418 AbstractCegarLoop]: === Iteration 57 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:24,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:24,143 INFO L82 PathProgramCache]: Analyzing trace with hash -879193696, now seen corresponding path program 56 times [2019-08-05 10:14:24,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:24,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:14:24,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:26,114 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:14:26,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:26,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:14:26,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:14:26,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:14:26,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:14:26,115 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:14:26,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:26,220 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:14:26,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:14:26,220 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:14:26,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:26,221 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:14:26,221 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:14:26,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:14:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:14:26,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:14:26,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:14:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:14:26,224 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:14:26,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:26,225 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:14:26,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:14:26,225 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:14:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:14:26,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:26,225 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:14:26,226 INFO L418 AbstractCegarLoop]: === Iteration 58 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:26,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:26,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1485190237, now seen corresponding path program 57 times [2019-08-05 10:14:26,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:26,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:14:26,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:29,362 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:14:29,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:29,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:14:29,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:14:29,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:14:29,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:14:29,363 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:14:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:29,473 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:14:29,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:14:29,473 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:14:29,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:29,474 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:14:29,474 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:14:29,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:14:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:14:29,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:14:29,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:14:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:14:29,478 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:14:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:29,478 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:14:29,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:14:29,479 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:14:29,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:14:29,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:29,479 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:14:29,480 INFO L418 AbstractCegarLoop]: === Iteration 59 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:29,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1203753472, now seen corresponding path program 58 times [2019-08-05 10:14:29,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:29,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:14:29,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:31,958 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:14:31,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:31,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:14:31,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:14:31,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:14:31,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:14:31,959 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:14:32,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:32,062 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:14:32,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:14:32,063 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:14:32,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:32,064 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:14:32,064 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:14:32,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:14:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:14:32,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:14:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:14:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:14:32,066 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:14:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:32,067 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:14:32,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:14:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:14:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:14:32,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:32,068 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:14:32,068 INFO L418 AbstractCegarLoop]: === Iteration 60 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:32,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1338337469, now seen corresponding path program 59 times [2019-08-05 10:14:32,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:32,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:14:32,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:34,613 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:14:34,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:34,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:14:34,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:14:34,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:14:34,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:14:34,614 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:14:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:34,740 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:14:34,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:14:34,740 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:14:34,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:34,741 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:14:34,741 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:14:34,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:14:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:14:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:14:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:14:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:14:34,744 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:14:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:34,744 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:14:34,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:14:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:14:34,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:14:34,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:34,745 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:14:34,746 INFO L418 AbstractCegarLoop]: === Iteration 61 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:34,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:34,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1461221984, now seen corresponding path program 60 times [2019-08-05 10:14:34,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:34,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:14:34,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:36,992 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:14:36,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:36,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:14:36,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:14:36,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:14:36,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:14:36,993 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:14:37,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:37,114 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:14:37,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:14:37,115 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:14:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:37,116 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:14:37,116 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:14:37,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:14:37,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:14:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:14:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:14:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:14:37,119 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:14:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:37,119 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:14:37,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:14:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:14:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:14:37,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:37,120 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:14:37,120 INFO L418 AbstractCegarLoop]: === Iteration 62 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:37,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:37,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1946748189, now seen corresponding path program 61 times [2019-08-05 10:14:37,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:37,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:14:37,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:39,735 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:14:39,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:39,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:14:39,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:14:39,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:14:39,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:14:39,737 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:14:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:39,883 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:14:39,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:14:39,884 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:14:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:39,885 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:14:39,885 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:14:39,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:14:39,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:14:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:14:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:14:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:14:39,888 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:14:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:39,888 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:14:39,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:14:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:14:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:14:39,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:39,889 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:14:39,889 INFO L418 AbstractCegarLoop]: === Iteration 63 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash -219641152, now seen corresponding path program 62 times [2019-08-05 10:14:39,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:39,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:14:39,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:42,294 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:14:42,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:42,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:14:42,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:14:42,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:14:42,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:14:42,295 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:14:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:42,436 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:14:42,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:14:42,436 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:14:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:42,437 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:14:42,437 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:14:42,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:14:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:14:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:14:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:14:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:14:42,440 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:14:42,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:42,440 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:14:42,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:14:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:14:42,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:14:42,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:42,441 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:14:42,441 INFO L418 AbstractCegarLoop]: === Iteration 64 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:42,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:42,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1781069443, now seen corresponding path program 63 times [2019-08-05 10:14:42,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:42,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:14:42,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:45,193 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:14:45,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:45,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:14:45,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:14:45,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:14:45,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:14:45,195 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:14:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:45,343 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:14:45,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:14:45,344 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:14:45,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:45,345 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:14:45,345 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:14:45,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:14:45,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:14:45,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:14:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:14:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:14:45,349 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:14:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:45,350 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:14:45,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:14:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:14:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:14:45,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:45,351 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:14:45,351 INFO L418 AbstractCegarLoop]: === Iteration 65 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:45,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:45,351 INFO L82 PathProgramCache]: Analyzing trace with hash -621411552, now seen corresponding path program 64 times [2019-08-05 10:14:45,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:45,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:14:45,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:48,277 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:14:48,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:48,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:14:48,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:14:48,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:14:48,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:14:48,279 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:14:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:48,426 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:14:48,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:14:48,427 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:14:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:48,427 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:14:48,428 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:14:48,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:14:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:14:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:14:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:14:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:14:48,431 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:14:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:48,431 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:14:48,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:14:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:14:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:14:48,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:48,432 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:14:48,432 INFO L418 AbstractCegarLoop]: === Iteration 66 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:48,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:48,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2083878365, now seen corresponding path program 65 times [2019-08-05 10:14:48,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:48,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:14:48,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:51,049 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:14:51,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:51,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:14:51,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:14:51,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:14:51,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:14:51,050 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:14:51,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:51,178 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:14:51,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:14:51,178 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:14:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:51,179 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:14:51,179 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:14:51,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:14:51,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:14:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:14:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:14:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:14:51,182 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:14:51,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:51,182 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:14:51,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:14:51,183 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:14:51,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:14:51,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:51,183 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:14:51,184 INFO L418 AbstractCegarLoop]: === Iteration 67 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:51,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:51,184 INFO L82 PathProgramCache]: Analyzing trace with hash -175709312, now seen corresponding path program 66 times [2019-08-05 10:14:51,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:51,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 10:14:51,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:55,770 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:14:55,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:55,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:14:55,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:14:55,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:14:55,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:14:55,772 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:14:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:55,899 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:14:55,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:14:55,900 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:14:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:55,901 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:14:55,901 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:14:55,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:14:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:14:55,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:14:55,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:14:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:14:55,904 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:14:55,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:55,904 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:14:55,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:14:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:14:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:14:55,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:55,905 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:14:55,905 INFO L418 AbstractCegarLoop]: === Iteration 68 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:55,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:55,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1152010813, now seen corresponding path program 67 times [2019-08-05 10:14:55,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:55,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:14:55,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:58,787 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:14:58,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:58,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:14:58,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:14:58,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:14:58,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:14:58,789 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:14:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:58,930 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:14:58,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:14:58,931 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:14:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:58,932 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:14:58,932 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:14:58,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:14:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:14:58,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:14:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:14:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:14:58,934 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:14:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:58,935 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:14:58,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:14:58,935 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:14:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:14:58,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:58,936 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:14:58,936 INFO L418 AbstractCegarLoop]: === Iteration 69 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1352586272, now seen corresponding path program 68 times [2019-08-05 10:14:58,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:58,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-05 10:14:58,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:01,736 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:15:01,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:01,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:15:01,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:15:01,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:15:01,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:15:01,737 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:15:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:01,888 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:15:01,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:15:01,889 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:15:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:01,889 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:15:01,889 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:15:01,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:15:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:15:01,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:15:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:15:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:15:01,892 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:15:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:01,892 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:15:01,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:15:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:15:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:15:01,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:01,893 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:15:01,893 INFO L418 AbstractCegarLoop]: === Iteration 70 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:01,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:01,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1019509091, now seen corresponding path program 69 times [2019-08-05 10:15:01,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:01,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:15:01,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:05,079 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:15:05,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:05,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:15:05,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:15:05,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:15:05,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:15:05,081 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:15:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:05,233 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:15:05,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:15:05,233 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:15:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:05,234 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:15:05,235 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:15:05,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:15:05,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:15:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:15:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:15:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:15:05,238 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:15:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:05,239 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:15:05,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:15:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:15:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:15:05,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:05,240 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:15:05,240 INFO L418 AbstractCegarLoop]: === Iteration 71 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:05,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1540021312, now seen corresponding path program 70 times [2019-08-05 10:15:05,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:05,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:15:05,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:08,132 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:15:08,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:08,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:15:08,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:15:08,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:15:08,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:15:08,134 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:15:08,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:08,334 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:15:08,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:15:08,335 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:15:08,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:08,335 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:15:08,336 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:15:08,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:15:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:15:08,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:15:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:15:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:15:08,338 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:15:08,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:08,339 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:15:08,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:15:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:15:08,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:15:08,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:08,340 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:15:08,340 INFO L418 AbstractCegarLoop]: === Iteration 72 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:08,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:08,340 INFO L82 PathProgramCache]: Analyzing trace with hash 496030979, now seen corresponding path program 71 times [2019-08-05 10:15:08,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:08,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:15:08,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:11,451 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:15:11,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:11,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:15:11,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:15:11,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:15:11,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:15:11,453 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:15:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:11,582 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:15:11,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:15:11,582 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:15:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:11,583 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:15:11,584 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:15:11,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:15:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:15:11,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:15:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:15:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:15:11,587 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:15:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:11,587 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:15:11,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:15:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:15:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:15:11,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:11,588 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:15:11,588 INFO L418 AbstractCegarLoop]: === Iteration 73 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:11,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:11,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1802898272, now seen corresponding path program 72 times [2019-08-05 10:15:11,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:11,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-05 10:15:11,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:14,994 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:15:14,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:14,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:15:14,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:15:14,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:15:14,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:15:14,996 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:15:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:15,143 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:15:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:15:15,144 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:15:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:15,145 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:15:15,145 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:15:15,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:15:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:15:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:15:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:15:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:15:15,147 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:15:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:15,148 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:15:15,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:15:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:15:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:15:15,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:15,148 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:15:15,148 INFO L418 AbstractCegarLoop]: === Iteration 74 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:15,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:15,149 INFO L82 PathProgramCache]: Analyzing trace with hash -55261021, now seen corresponding path program 73 times [2019-08-05 10:15:15,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:15,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:15:15,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:18,957 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:15:18,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:18,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:15:18,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:15:18,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:15:18,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:15:18,958 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:15:19,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:19,106 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:15:19,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:15:19,107 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:15:19,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:19,108 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:15:19,108 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:15:19,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:15:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:15:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:15:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:15:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:15:19,111 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:15:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:19,111 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:15:19,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:15:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:15:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:15:19,112 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:19,112 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:15:19,112 INFO L418 AbstractCegarLoop]: === Iteration 75 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:19,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:19,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1713081088, now seen corresponding path program 74 times [2019-08-05 10:15:19,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:19,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 10:15:19,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:22,354 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:15:22,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:22,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:15:22,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:15:22,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:15:22,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:15:22,356 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:15:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:22,487 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:15:22,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:15:22,488 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:15:22,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:22,488 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:15:22,489 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:15:22,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:15:22,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:15:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:15:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:15:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:15:22,492 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:15:22,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:22,492 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:15:22,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:15:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:15:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:15:22,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:22,493 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:15:22,493 INFO L418 AbstractCegarLoop]: === Iteration 76 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:22,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:22,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1565895613, now seen corresponding path program 75 times [2019-08-05 10:15:22,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:22,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:15:22,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:26,004 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:15:26,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:26,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:15:26,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:15:26,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:15:26,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:15:26,005 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:15:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:26,154 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:15:26,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:15:26,154 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:15:26,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:26,155 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:15:26,155 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:15:26,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:15:26,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:15:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:15:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:15:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:15:26,158 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:15:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:26,158 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:15:26,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:15:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:15:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:15:26,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:26,159 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:15:26,160 INFO L418 AbstractCegarLoop]: === Iteration 77 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:26,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:26,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1298113184, now seen corresponding path program 76 times [2019-08-05 10:15:26,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:26,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:15:26,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:29,790 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:15:29,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:29,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:15:29,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:15:29,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:15:29,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:15:29,792 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:15:29,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:29,937 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:15:29,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:15:29,938 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:15:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:29,939 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:15:29,939 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:15:29,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:15:29,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:15:29,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:15:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:15:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:15:29,942 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:15:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:29,943 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:15:29,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:15:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:15:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:15:29,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:29,944 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:15:29,944 INFO L418 AbstractCegarLoop]: === Iteration 78 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:29,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:29,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1586792477, now seen corresponding path program 77 times [2019-08-05 10:15:29,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:30,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:15:30,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:33,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:33,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:15:33,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:15:33,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:15:33,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:15:33,685 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:15:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:34,118 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:15:34,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:15:34,118 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:15:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:34,119 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:15:34,119 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:15:34,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:15:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:15:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:15:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:15:34,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:15:34,122 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:15:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:34,123 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:15:34,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:15:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:15:34,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:15:34,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:34,124 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:15:34,124 INFO L418 AbstractCegarLoop]: === Iteration 79 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:34,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:34,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1945915968, now seen corresponding path program 78 times [2019-08-05 10:15:34,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:34,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-05 10:15:34,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:37,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:37,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:15:37,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:15:37,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:15:37,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:15:37,642 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:15:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:37,894 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:15:37,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:15:37,895 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:15:37,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:37,896 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:15:37,896 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:15:37,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:15:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:15:37,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:15:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:15:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:15:37,900 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:15:37,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:37,900 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:15:37,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:15:37,900 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:15:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:15:37,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:37,901 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:15:37,901 INFO L418 AbstractCegarLoop]: === Iteration 80 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:37,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:37,901 INFO L82 PathProgramCache]: Analyzing trace with hash -193842301, now seen corresponding path program 79 times [2019-08-05 10:15:37,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:37,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:15:37,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:41,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:41,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:15:41,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:15:41,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:15:41,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:15:41,733 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:15:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:41,894 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:15:41,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:15:41,894 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:15:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:41,895 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:15:41,895 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:15:41,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:15:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:15:41,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:15:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:15:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:15:41,898 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:15:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:41,899 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:15:41,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:15:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:15:41,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:15:41,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:41,899 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:15:41,899 INFO L418 AbstractCegarLoop]: === Iteration 81 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:41,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:41,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1714133472, now seen corresponding path program 80 times [2019-08-05 10:15:41,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:41,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-05 10:15:41,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:45,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:45,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:15:45,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:15:45,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:15:45,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:15:45,849 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:15:46,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:46,028 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:15:46,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:15:46,029 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:15:46,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:46,029 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:15:46,030 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:15:46,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:15:46,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:15:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:15:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:15:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:15:46,032 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:15:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:46,032 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:15:46,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:15:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:15:46,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:15:46,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:46,033 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:15:46,034 INFO L418 AbstractCegarLoop]: === Iteration 82 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:46,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:46,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1598519517, now seen corresponding path program 81 times [2019-08-05 10:15:46,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:46,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 10:15:46,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:50,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:50,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:15:50,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:15:50,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:15:50,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:15:50,577 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:15:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:50,895 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:15:50,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:15:50,896 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:15:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:50,897 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:15:50,897 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:15:50,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:15:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:15:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:15:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:15:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:15:50,900 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:15:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:50,900 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:15:50,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:15:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:15:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:15:50,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:50,901 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:15:50,901 INFO L418 AbstractCegarLoop]: === Iteration 83 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:50,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:50,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1985513088, now seen corresponding path program 82 times [2019-08-05 10:15:50,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:50,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 10:15:50,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:55,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:55,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:15:55,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:15:55,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:15:55,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:15:55,017 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:15:55,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:55,179 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:15:55,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:15:55,180 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:15:55,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:55,180 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:15:55,180 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:15:55,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:15:55,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:15:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:15:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:15:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:15:55,183 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:15:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:55,183 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:15:55,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:15:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:15:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:15:55,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:55,184 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:15:55,184 INFO L418 AbstractCegarLoop]: === Iteration 84 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:55,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:55,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1421374147, now seen corresponding path program 83 times [2019-08-05 10:15:55,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:55,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-05 10:15:55,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:59,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:59,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:15:59,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:15:59,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:15:59,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:15:59,681 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:15:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:59,945 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:15:59,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:15:59,946 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:15:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:59,947 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:15:59,947 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:15:59,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:15:59,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:15:59,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:15:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:15:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:15:59,950 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:15:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:59,950 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:15:59,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:15:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:15:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:15:59,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:59,951 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:15:59,951 INFO L418 AbstractCegarLoop]: === Iteration 85 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:59,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:59,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1112936160, now seen corresponding path program 84 times [2019-08-05 10:15:59,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:00,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 172 conjunts are in the unsatisfiable core [2019-08-05 10:16:00,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:04,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:04,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:16:04,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:16:04,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:16:04,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:16:04,031 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:16:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:04,210 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:16:04,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:16:04,211 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:16:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:04,211 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:16:04,211 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:16:04,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:16:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:16:04,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:16:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:16:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:16:04,215 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:16:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:04,215 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:16:04,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:16:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:16:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:16:04,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:04,216 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:16:04,216 INFO L418 AbstractCegarLoop]: === Iteration 86 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:04,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:04,217 INFO L82 PathProgramCache]: Analyzing trace with hash 141293155, now seen corresponding path program 85 times [2019-08-05 10:16:04,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:04,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-05 10:16:04,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:08,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:08,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:16:08,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:16:08,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:16:08,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:16:08,668 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:16:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:08,934 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:16:08,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:16:08,935 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:16:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:08,936 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:16:08,936 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:16:08,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:16:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:16:08,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:16:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:16:08,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:16:08,939 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:16:08,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:08,939 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:16:08,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:16:08,939 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:16:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:16:08,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:08,940 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:16:08,940 INFO L418 AbstractCegarLoop]: === Iteration 87 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:08,940 INFO L82 PathProgramCache]: Analyzing trace with hash 85131072, now seen corresponding path program 86 times [2019-08-05 10:16:08,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:09,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 176 conjunts are in the unsatisfiable core [2019-08-05 10:16:09,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:13,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:13,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:16:13,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:16:13,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:16:13,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:16:13,468 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:16:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:13,648 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:16:13,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:16:13,648 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:16:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:13,649 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:16:13,649 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:16:13,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:16:13,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:16:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:16:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:16:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:16:13,652 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:16:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:13,652 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:16:13,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:16:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:16:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:16:13,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:13,653 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:16:13,653 INFO L418 AbstractCegarLoop]: === Iteration 88 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:13,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:13,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1655893501, now seen corresponding path program 87 times [2019-08-05 10:16:13,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:13,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 178 conjunts are in the unsatisfiable core [2019-08-05 10:16:13,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:18,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:18,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:16:18,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:16:18,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:16:18,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:16:18,144 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:16:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:18,307 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:16:18,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:16:18,308 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:16:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:18,308 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:16:18,309 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:16:18,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:16:18,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:16:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:16:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:16:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:16:18,311 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:16:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:18,311 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:16:18,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:16:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:16:18,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:16:18,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:18,312 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:16:18,312 INFO L418 AbstractCegarLoop]: === Iteration 89 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:18,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:18,313 INFO L82 PathProgramCache]: Analyzing trace with hash 206919584, now seen corresponding path program 88 times [2019-08-05 10:16:18,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:18,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 180 conjunts are in the unsatisfiable core [2019-08-05 10:16:18,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:22,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:22,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:16:22,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:16:22,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:16:22,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:16:22,965 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:16:23,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:23,147 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:16:23,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:16:23,147 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:16:23,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:23,148 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:16:23,148 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:16:23,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:16:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:16:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:16:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:16:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:16:23,150 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:16:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:23,151 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:16:23,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:16:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:16:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:16:23,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:23,152 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:16:23,152 INFO L418 AbstractCegarLoop]: === Iteration 90 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:23,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2119550371, now seen corresponding path program 89 times [2019-08-05 10:16:23,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:23,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-05 10:16:23,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:27,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:27,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:16:27,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:16:27,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:16:27,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:16:27,786 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:16:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:28,251 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:16:28,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:16:28,251 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:16:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:28,252 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:16:28,252 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:16:28,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:16:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:16:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:16:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:16:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:16:28,255 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:16:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:28,256 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:16:28,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:16:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:16:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:16:28,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:28,257 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:16:28,257 INFO L418 AbstractCegarLoop]: === Iteration 91 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:28,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:28,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1281562624, now seen corresponding path program 90 times [2019-08-05 10:16:28,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:28,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 184 conjunts are in the unsatisfiable core [2019-08-05 10:16:28,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:33,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:33,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:16:33,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:16:33,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:16:33,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:16:33,084 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:16:33,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:33,269 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:16:33,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:16:33,270 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:16:33,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:33,271 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:16:33,271 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:16:33,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:16:33,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:16:33,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:16:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:16:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:16:33,273 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:16:33,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:33,273 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:16:33,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:16:33,273 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:16:33,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:16:33,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:33,274 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:16:33,274 INFO L418 AbstractCegarLoop]: === Iteration 92 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:33,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:33,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1073746243, now seen corresponding path program 91 times [2019-08-05 10:16:33,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:33,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-05 10:16:33,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:38,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:38,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:16:38,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:16:38,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:16:38,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:16:38,069 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:16:38,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:38,244 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:16:38,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:16:38,245 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:16:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:38,246 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:16:38,246 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:16:38,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:16:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:16:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:16:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:16:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:16:38,249 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:16:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:38,249 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:16:38,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:16:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:16:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:16:38,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:38,250 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:16:38,251 INFO L418 AbstractCegarLoop]: === Iteration 93 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:38,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:38,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1073594272, now seen corresponding path program 92 times [2019-08-05 10:16:38,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:38,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 188 conjunts are in the unsatisfiable core [2019-08-05 10:16:38,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:43,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:43,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:16:43,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:16:43,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:16:43,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:16:43,271 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:16:43,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:43,467 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:16:43,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:16:43,467 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:16:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:43,468 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:16:43,468 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:16:43,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:16:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:16:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:16:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:16:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:16:43,471 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:16:43,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:43,471 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:16:43,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:16:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:16:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:16:43,472 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:43,472 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:16:43,472 INFO L418 AbstractCegarLoop]: === Iteration 94 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:43,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1078326499, now seen corresponding path program 93 times [2019-08-05 10:16:43,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:43,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 190 conjunts are in the unsatisfiable core [2019-08-05 10:16:43,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:48,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:48,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:16:48,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:16:48,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:16:48,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:16:48,637 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 10:16:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:48,826 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:16:48,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:16:48,826 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:16:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:48,837 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:16:48,837 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:16:48,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:16:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:16:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:16:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:16:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:16:48,839 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:16:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:48,839 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:16:48,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:16:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:16:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:16:48,840 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:48,840 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 10:16:48,840 INFO L418 AbstractCegarLoop]: === Iteration 95 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:48,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:48,840 INFO L82 PathProgramCache]: Analyzing trace with hash -931606336, now seen corresponding path program 94 times [2019-08-05 10:16:48,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:48,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 192 conjunts are in the unsatisfiable core [2019-08-05 10:16:48,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:54,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:54,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:16:54,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:16:54,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:16:54,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:16:54,073 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 10:16:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:54,285 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:16:54,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:16:54,286 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 10:16:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:54,287 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:16:54,287 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:16:54,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:16:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:16:54,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:16:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:16:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:16:54,289 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:16:54,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:54,290 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:16:54,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:16:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:16:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:16:54,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:54,291 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 10:16:54,291 INFO L418 AbstractCegarLoop]: === Iteration 96 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:54,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:54,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1184985219, now seen corresponding path program 95 times [2019-08-05 10:16:54,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:54,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 194 conjunts are in the unsatisfiable core [2019-08-05 10:16:54,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:59,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:59,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:16:59,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:16:59,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:16:59,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:16:59,613 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 10:16:59,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:59,813 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:16:59,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:16:59,814 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:16:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:59,815 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:16:59,815 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:16:59,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:16:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:16:59,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:16:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:16:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:16:59,818 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:16:59,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:59,818 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:16:59,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:16:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:16:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:16:59,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:59,819 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:16:59,819 INFO L418 AbstractCegarLoop]: === Iteration 97 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:59,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:59,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1920153312, now seen corresponding path program 96 times [2019-08-05 10:16:59,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:59,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 196 conjunts are in the unsatisfiable core [2019-08-05 10:16:59,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:05,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:05,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:17:05,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:17:05,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:17:05,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:17:05,190 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:17:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:05,412 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:17:05,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:17:05,412 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:17:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:05,413 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:17:05,413 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:17:05,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:17:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:17:05,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:17:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:17:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:17:05,416 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:17:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:05,417 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:17:05,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:17:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:17:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:17:05,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:05,417 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:17:05,418 INFO L418 AbstractCegarLoop]: === Iteration 98 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:05,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:05,418 INFO L82 PathProgramCache]: Analyzing trace with hash 604800035, now seen corresponding path program 97 times [2019-08-05 10:17:05,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:05,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-05 10:17:05,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:10,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:10,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:17:10,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:17:10,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:17:10,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:17:10,835 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:17:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:11,208 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:17:11,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:17:11,208 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:17:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:11,209 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:17:11,209 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:17:11,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:17:11,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:17:11,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:17:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:17:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:17:11,211 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:17:11,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:11,212 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:17:11,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:17:11,212 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:17:11,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:17:11,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:11,213 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 10:17:11,213 INFO L418 AbstractCegarLoop]: === Iteration 99 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:11,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:11,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1568942464, now seen corresponding path program 98 times [2019-08-05 10:17:11,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:11,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 200 conjunts are in the unsatisfiable core [2019-08-05 10:17:11,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:16,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:16,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:17:16,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:17:16,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:17:16,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:17:16,681 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 10:17:16,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:16,875 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:17:16,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:17:16,875 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 10:17:16,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:16,876 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:17:16,876 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:17:16,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:17:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:17:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:17:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:17:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:17:16,879 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:17:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:16,880 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:17:16,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:17:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:17:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:17:16,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:16,881 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 10:17:16,881 INFO L418 AbstractCegarLoop]: === Iteration 100 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:16,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:16,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1392586691, now seen corresponding path program 99 times [2019-08-05 10:17:16,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:16,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 202 conjunts are in the unsatisfiable core [2019-08-05 10:17:16,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:17:22,476 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:17:22,476 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:17:22,480 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:17:22,480 INFO L202 PluginConnector]: Adding new model RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:17:22 BoogieIcfgContainer [2019-08-05 10:17:22,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:17:22,483 INFO L168 Benchmark]: Toolchain (without parser) took 243403.47 ms. Allocated memory was 133.7 MB in the beginning and 580.4 MB in the end (delta: 446.7 MB). Free memory was 110.2 MB in the beginning and 386.4 MB in the end (delta: -276.2 MB). Peak memory consumption was 170.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:17:22,483 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 133.7 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 10:17:22,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.42 ms. Allocated memory is still 133.7 MB. Free memory was 110.2 MB in the beginning and 108.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:17:22,484 INFO L168 Benchmark]: Boogie Preprocessor took 21.49 ms. Allocated memory is still 133.7 MB. Free memory was 108.4 MB in the beginning and 107.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:17:22,485 INFO L168 Benchmark]: RCFGBuilder took 562.70 ms. Allocated memory is still 133.7 MB. Free memory was 107.1 MB in the beginning and 93.2 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:17:22,486 INFO L168 Benchmark]: TraceAbstraction took 242781.33 ms. Allocated memory was 133.7 MB in the beginning and 580.4 MB in the end (delta: 446.7 MB). Free memory was 93.0 MB in the beginning and 386.4 MB in the end (delta: -293.4 MB). Peak memory consumption was 153.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:17:22,489 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.16 ms. Allocated memory is still 133.7 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.42 ms. Allocated memory is still 133.7 MB. Free memory was 110.2 MB in the beginning and 108.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.49 ms. Allocated memory is still 133.7 MB. Free memory was 108.4 MB in the beginning and 107.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 562.70 ms. Allocated memory is still 133.7 MB. Free memory was 107.1 MB in the beginning and 93.2 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242781.33 ms. Allocated memory was 133.7 MB in the beginning and 580.4 MB in the end (delta: 446.7 MB). Free memory was 93.0 MB in the beginning and 386.4 MB in the end (delta: -293.4 MB). Peak memory consumption was 153.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 103 with TraceHistMax 99,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 242.7s OverallTime, 100 OverallIterations, 99 TraceHistogramMax, 13.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 298 SDtfs, 0 SDslu, 1349 SDs, 0 SdLazy, 6397 SolverSat, 186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5049 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 212.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 99 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 219.5s InterpolantComputationTime, 5148 NumberOfCodeBlocks, 5148 NumberOfCodeBlocksAsserted, 99 NumberOfCheckSat, 5049 ConstructedInterpolants, 4950 QuantifiedInterpolants, 4671249 SizeOfPredicates, 5148 NumberOfNonLiveVariables, 30690 ConjunctsInSsa, 10098 ConjunctsInUnsatCore, 99 InterpolantComputations, 1 PerfectInterpolantSequences, 0/161700 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown