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/BoogiePL/AlternatingAutomata/test2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 09:53:41,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 09:53:41,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 09:53:41,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 09:53:41,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 09:53:41,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 09:53:41,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 09:53:41,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 09:53:41,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 09:53:41,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 09:53:41,141 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 09:53:41,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 09:53:41,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 09:53:41,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 09:53:41,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 09:53:41,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 09:53:41,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 09:53:41,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 09:53:41,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 09:53:41,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 09:53:41,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 09:53:41,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 09:53:41,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 09:53:41,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 09:53:41,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 09:53:41,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 09:53:41,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 09:53:41,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 09:53:41,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 09:53:41,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 09:53:41,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 09:53:41,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 09:53:41,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 09:53:41,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 09:53:41,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 09:53:41,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 09:53:41,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 09:53:41,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 09:53:41,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 09:53:41,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 09:53:41,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 09:53:41,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 09:53:41,214 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 09:53:41,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 09:53:41,221 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 09:53:41,221 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 09:53:41,223 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/BoogiePL/AlternatingAutomata/test2.bpl [2019-08-05 09:53:41,223 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/BoogiePL/AlternatingAutomata/test2.bpl' [2019-08-05 09:53:41,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 09:53:41,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 09:53:41,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 09:53:41,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 09:53:41,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 09:53:41,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "test2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:41" (1/1) ... [2019-08-05 09:53:41,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "test2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:41" (1/1) ... [2019-08-05 09:53:41,301 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 09:53:41,301 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 09:53:41,301 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 09:53:41,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 09:53:41,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 09:53:41,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 09:53:41,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 09:53:41,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:41" (1/1) ... [2019-08-05 09:53:41,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:41" (1/1) ... [2019-08-05 09:53:41,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:41" (1/1) ... [2019-08-05 09:53:41,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:41" (1/1) ... [2019-08-05 09:53:41,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:41" (1/1) ... [2019-08-05 09:53:41,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:41" (1/1) ... [2019-08-05 09:53:41,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:41" (1/1) ... [2019-08-05 09:53:41,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 09:53:41,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 09:53:41,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 09:53:41,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 09:53:41,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:41" (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 09:53:41,412 INFO L124 BoogieDeclarations]: Specification and implementation of procedure bla given in one single declaration [2019-08-05 09:53:41,412 INFO L130 BoogieDeclarations]: Found specification of procedure bla [2019-08-05 09:53:41,413 INFO L138 BoogieDeclarations]: Found implementation of procedure bla [2019-08-05 09:53:41,413 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ~init given in one single declaration [2019-08-05 09:53:41,413 INFO L130 BoogieDeclarations]: Found specification of procedure ~init [2019-08-05 09:53:41,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ~init [2019-08-05 09:53:41,614 INFO L275 CfgBuilder]: Using library mode [2019-08-05 09:53:41,614 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 09:53:41,616 INFO L202 PluginConnector]: Adding new model test2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:53:41 BoogieIcfgContainer [2019-08-05 09:53:41,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 09:53:41,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 09:53:41,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 09:53:41,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 09:53:41,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:41" (1/2) ... [2019-08-05 09:53:41,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58aa2276 and model type test2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 09:53:41, skipping insertion in model container [2019-08-05 09:53:41,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:53:41" (2/2) ... [2019-08-05 09:53:41,629 INFO L109 eAbstractionObserver]: Analyzing ICFG test2.bpl [2019-08-05 09:53:41,643 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 09:53:41,651 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 09:53:41,670 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 09:53:41,705 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 09:53:41,706 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 09:53:41,706 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 09:53:41,707 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 09:53:41,707 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 09:53:41,707 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 09:53:41,707 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 09:53:41,707 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 09:53:41,708 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 09:53:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 09:53:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 09:53:41,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:41,733 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 09:53:41,735 INFO L418 AbstractCegarLoop]: === Iteration 1 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:41,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:41,741 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2019-08-05 09:53:41,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:41,825 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 09:53:41,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:41,900 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 09:53:41,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:53:41,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 09:53:41,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:53:41,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:53:41,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:53:41,922 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 09:53:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:41,998 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2019-08-05 09:53:41,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:53:42,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 09:53:42,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:42,018 INFO L225 Difference]: With dead ends: 8 [2019-08-05 09:53:42,019 INFO L226 Difference]: Without dead ends: 4 [2019-08-05 09:53:42,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 09:53:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-08-05 09:53:42,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-08-05 09:53:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-08-05 09:53:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-08-05 09:53:42,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-08-05 09:53:42,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:42,064 INFO L475 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-08-05 09:53:42,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:53:42,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-08-05 09:53:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 09:53:42,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:42,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 09:53:42,066 INFO L418 AbstractCegarLoop]: === Iteration 2 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:42,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:42,067 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2019-08-05 09:53:42,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:42,077 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 09:53:42,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:42,240 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 09:53:42,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:42,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 09:53:42,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 09:53:42,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 09:53:42,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:53:42,243 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-08-05 09:53:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:42,278 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 09:53:42,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 09:53:42,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 09:53:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:42,279 INFO L225 Difference]: With dead ends: 5 [2019-08-05 09:53:42,279 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 09:53:42,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:53:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 09:53:42,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 09:53:42,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 09:53:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 09:53:42,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 09:53:42,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:42,282 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 09:53:42,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 09:53:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 09:53:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 09:53:42,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:42,283 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-08-05 09:53:42,284 INFO L418 AbstractCegarLoop]: === Iteration 3 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:42,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:42,287 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2019-08-05 09:53:42,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:42,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 09:53:42,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:42,419 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 09:53:42,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:42,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 09:53:42,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 09:53:42,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 09:53:42,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:53:42,422 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 09:53:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:42,456 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 09:53:42,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 09:53:42,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 09:53:42,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:42,458 INFO L225 Difference]: With dead ends: 6 [2019-08-05 09:53:42,458 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 09:53:42,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:53:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 09:53:42,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 09:53:42,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 09:53:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 09:53:42,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 09:53:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:42,462 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 09:53:42,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 09:53:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 09:53:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 09:53:42,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:42,463 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-08-05 09:53:42,463 INFO L418 AbstractCegarLoop]: === Iteration 4 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:42,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:42,464 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2019-08-05 09:53:42,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:42,477 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 09:53:42,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:42,700 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 09:53:42,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:42,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 09:53:42,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 09:53:42,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 09:53:42,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 09:53:42,702 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 09:53:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:42,828 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 09:53:42,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 09:53:42,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 09:53:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:42,829 INFO L225 Difference]: With dead ends: 7 [2019-08-05 09:53:42,829 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 09:53:42,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 09:53:42,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 09:53:42,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 09:53:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 09:53:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 09:53:42,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 09:53:42,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:42,833 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 09:53:42,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 09:53:42,833 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 09:53:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 09:53:42,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:42,834 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-08-05 09:53:42,834 INFO L418 AbstractCegarLoop]: === Iteration 5 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:42,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:42,835 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2019-08-05 09:53:42,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:42,849 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 09:53:42,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:43,071 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 09:53:43,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:43,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 09:53:43,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 09:53:43,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 09:53:43,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 09:53:43,073 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 09:53:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:43,149 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 09:53:43,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 09:53:43,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 09:53:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:43,150 INFO L225 Difference]: With dead ends: 8 [2019-08-05 09:53:43,151 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 09:53:43,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 09:53:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 09:53:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 09:53:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 09:53:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 09:53:43,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 09:53:43,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:43,155 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 09:53:43,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 09:53:43,155 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 09:53:43,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 09:53:43,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:43,156 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-08-05 09:53:43,156 INFO L418 AbstractCegarLoop]: === Iteration 6 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:43,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:43,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2019-08-05 09:53:43,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:43,173 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 09:53:43,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:43,406 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 09:53:43,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:43,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 09:53:43,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 09:53:43,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 09:53:43,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 09:53:43,408 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 09:53:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:43,523 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 09:53:43,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 09:53:43,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 09:53:43,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:43,525 INFO L225 Difference]: With dead ends: 9 [2019-08-05 09:53:43,525 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 09:53:43,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 09:53:43,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 09:53:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 09:53:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 09:53:43,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 09:53:43,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 09:53:43,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:43,528 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 09:53:43,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 09:53:43,528 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 09:53:43,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 09:53:43,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:43,529 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1] [2019-08-05 09:53:43,529 INFO L418 AbstractCegarLoop]: === Iteration 7 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:43,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:43,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2019-08-05 09:53:43,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:43,546 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 09:53:43,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:43,958 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 09:53:43,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:43,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 09:53:43,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 09:53:43,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 09:53:43,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 09:53:43,960 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 09:53:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:44,103 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 09:53:44,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 09:53:44,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 09:53:44,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:44,105 INFO L225 Difference]: With dead ends: 10 [2019-08-05 09:53:44,105 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 09:53:44,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 09:53:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 09:53:44,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 09:53:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 09:53:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 09:53:44,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 09:53:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:44,109 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 09:53:44,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 09:53:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 09:53:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 09:53:44,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:44,110 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1] [2019-08-05 09:53:44,111 INFO L418 AbstractCegarLoop]: === Iteration 8 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:44,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2019-08-05 09:53:44,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:44,129 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 09:53:44,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:44,319 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 09:53:44,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:44,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 09:53:44,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 09:53:44,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 09:53:44,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 09:53:44,322 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 09:53:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:44,416 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 09:53:44,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 09:53:44,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 09:53:44,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:44,418 INFO L225 Difference]: With dead ends: 11 [2019-08-05 09:53:44,418 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 09:53:44,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 09:53:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 09:53:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 09:53:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 09:53:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 09:53:44,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 09:53:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:44,422 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 09:53:44,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 09:53:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 09:53:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 09:53:44,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:44,423 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1] [2019-08-05 09:53:44,423 INFO L418 AbstractCegarLoop]: === Iteration 9 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:44,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:44,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2019-08-05 09:53:44,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:44,443 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 09:53:44,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:44,641 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 09:53:44,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:44,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 09:53:44,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 09:53:44,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 09:53:44,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 09:53:44,643 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 09:53:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:44,784 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 09:53:44,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 09:53:44,785 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 09:53:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:44,786 INFO L225 Difference]: With dead ends: 12 [2019-08-05 09:53:44,786 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 09:53:44,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 09:53:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 09:53:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 09:53:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 09:53:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 09:53:44,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 09:53:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:44,791 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 09:53:44,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 09:53:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 09:53:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 09:53:44,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:44,792 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1] [2019-08-05 09:53:44,792 INFO L418 AbstractCegarLoop]: === Iteration 10 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:44,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:44,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2019-08-05 09:53:44,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:44,822 WARN L254 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 09:53:44,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:45,058 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 09:53:45,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:45,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 09:53:45,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 09:53:45,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 09:53:45,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 09:53:45,061 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 09:53:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:45,167 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 09:53:45,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 09:53:45,167 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 09:53:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:45,168 INFO L225 Difference]: With dead ends: 13 [2019-08-05 09:53:45,168 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 09:53:45,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 09:53:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 09:53:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 09:53:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 09:53:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 09:53:45,172 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 09:53:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:45,172 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 09:53:45,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 09:53:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 09:53:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 09:53:45,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:45,173 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1] [2019-08-05 09:53:45,173 INFO L418 AbstractCegarLoop]: === Iteration 11 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:45,174 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2019-08-05 09:53:45,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:45,195 WARN L254 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 09:53:45,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:45,379 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 09:53:45,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:45,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 09:53:45,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 09:53:45,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 09:53:45,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 09:53:45,381 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 09:53:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:45,494 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 09:53:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 09:53:45,494 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 09:53:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:45,495 INFO L225 Difference]: With dead ends: 14 [2019-08-05 09:53:45,495 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 09:53:45,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 09:53:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 09:53:45,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 09:53:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 09:53:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 09:53:45,498 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 09:53:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:45,498 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 09:53:45,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 09:53:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 09:53:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 09:53:45,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:45,499 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1] [2019-08-05 09:53:45,500 INFO L418 AbstractCegarLoop]: === Iteration 12 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:45,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:45,500 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2019-08-05 09:53:45,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:45,516 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 09:53:45,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:45,749 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 09:53:45,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:45,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 09:53:45,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 09:53:45,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 09:53:45,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 09:53:45,751 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 09:53:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:45,901 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 09:53:45,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 09:53:45,901 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 09:53:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:45,902 INFO L225 Difference]: With dead ends: 15 [2019-08-05 09:53:45,903 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 09:53:45,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 09:53:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 09:53:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 09:53:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 09:53:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 09:53:45,907 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 09:53:45,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:45,907 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 09:53:45,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 09:53:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 09:53:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 09:53:45,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:45,909 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1] [2019-08-05 09:53:45,909 INFO L418 AbstractCegarLoop]: === Iteration 13 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:45,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:45,909 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2019-08-05 09:53:45,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:45,930 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 09:53:45,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:46,411 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 09:53:46,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:46,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 09:53:46,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 09:53:46,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 09:53:46,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 09:53:46,414 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-05 09:53:46,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:46,596 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 09:53:46,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 09:53:46,597 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 09:53:46,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:46,598 INFO L225 Difference]: With dead ends: 16 [2019-08-05 09:53:46,598 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 09:53:46,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 09:53:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 09:53:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 09:53:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 09:53:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 09:53:46,602 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 09:53:46,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:46,602 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 09:53:46,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 09:53:46,602 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 09:53:46,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 09:53:46,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:46,603 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1] [2019-08-05 09:53:46,603 INFO L418 AbstractCegarLoop]: === Iteration 14 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:46,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:46,604 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2019-08-05 09:53:46,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:46,620 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 09:53:46,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:46,819 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 09:53:46,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:46,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 09:53:46,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 09:53:46,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 09:53:46,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 09:53:46,821 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-08-05 09:53:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:47,089 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 09:53:47,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 09:53:47,090 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 09:53:47,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:47,091 INFO L225 Difference]: With dead ends: 17 [2019-08-05 09:53:47,091 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 09:53:47,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 09:53:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 09:53:47,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 09:53:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 09:53:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 09:53:47,095 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 09:53:47,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:47,095 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 09:53:47,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 09:53:47,096 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 09:53:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 09:53:47,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:47,096 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1] [2019-08-05 09:53:47,097 INFO L418 AbstractCegarLoop]: === Iteration 15 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:47,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:47,097 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2019-08-05 09:53:47,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:47,115 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 09:53:47,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:47,572 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 09:53:47,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:47,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 09:53:47,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 09:53:47,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 09:53:47,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 09:53:47,574 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-08-05 09:53:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:47,860 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 09:53:47,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 09:53:47,861 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 09:53:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:47,862 INFO L225 Difference]: With dead ends: 18 [2019-08-05 09:53:47,862 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 09:53:47,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 09:53:47,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 09:53:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 09:53:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 09:53:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 09:53:47,866 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 09:53:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:47,867 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 09:53:47,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 09:53:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 09:53:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 09:53:47,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:47,868 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1] [2019-08-05 09:53:47,868 INFO L418 AbstractCegarLoop]: === Iteration 16 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:47,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:47,869 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2019-08-05 09:53:47,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:47,886 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 09:53:47,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:48,353 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 09:53:48,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:48,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 09:53:48,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 09:53:48,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 09:53:48,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 09:53:48,355 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-08-05 09:53:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:48,565 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 09:53:48,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 09:53:48,565 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 09:53:48,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:48,566 INFO L225 Difference]: With dead ends: 19 [2019-08-05 09:53:48,567 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 09:53:48,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 09:53:48,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 09:53:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 09:53:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 09:53:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 09:53:48,572 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 09:53:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:48,573 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 09:53:48,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 09:53:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 09:53:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 09:53:48,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:48,573 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1] [2019-08-05 09:53:48,574 INFO L418 AbstractCegarLoop]: === Iteration 17 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:48,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:48,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2019-08-05 09:53:48,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:48,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 09:53:48,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:49,198 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 09:53:49,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:49,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 09:53:49,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 09:53:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 09:53:49,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 09:53:49,200 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-08-05 09:53:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:49,441 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 09:53:49,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 09:53:49,441 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 09:53:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:49,442 INFO L225 Difference]: With dead ends: 20 [2019-08-05 09:53:49,442 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 09:53:49,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 09:53:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 09:53:49,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 09:53:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 09:53:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 09:53:49,446 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 09:53:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:49,446 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 09:53:49,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 09:53:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 09:53:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 09:53:49,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:49,447 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1] [2019-08-05 09:53:49,447 INFO L418 AbstractCegarLoop]: === Iteration 18 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:49,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:49,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2019-08-05 09:53:49,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:49,465 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 09:53:49,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:49,853 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 09:53:49,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:49,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 09:53:49,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 09:53:49,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 09:53:49,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 09:53:49,855 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-08-05 09:53:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:50,239 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 09:53:50,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 09:53:50,239 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 09:53:50,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:50,240 INFO L225 Difference]: With dead ends: 21 [2019-08-05 09:53:50,240 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 09:53:50,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 09:53:50,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 09:53:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 09:53:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 09:53:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 09:53:50,245 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 09:53:50,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:50,245 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 09:53:50,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 09:53:50,245 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 09:53:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:53:50,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:50,246 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1] [2019-08-05 09:53:50,246 INFO L418 AbstractCegarLoop]: === Iteration 19 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:50,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:50,247 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2019-08-05 09:53:50,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:50,261 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 09:53:50,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:50,547 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 09:53:50,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:50,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 09:53:50,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 09:53:50,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 09:53:50,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 09:53:50,549 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-08-05 09:53:50,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:50,848 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 09:53:50,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 09:53:50,848 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 09:53:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:50,849 INFO L225 Difference]: With dead ends: 22 [2019-08-05 09:53:50,850 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 09:53:50,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 09:53:50,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 09:53:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 09:53:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 09:53:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 09:53:50,853 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 09:53:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:50,853 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 09:53:50,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 09:53:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 09:53:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 09:53:50,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:50,854 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1] [2019-08-05 09:53:50,855 INFO L418 AbstractCegarLoop]: === Iteration 20 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:50,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:50,855 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2019-08-05 09:53:50,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:50,869 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 09:53:50,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:51,247 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 09:53:51,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:51,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 09:53:51,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 09:53:51,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 09:53:51,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 09:53:51,249 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-08-05 09:53:51,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:51,657 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 09:53:51,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 09:53:51,659 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 09:53:51,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:51,660 INFO L225 Difference]: With dead ends: 23 [2019-08-05 09:53:51,660 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 09:53:51,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 09:53:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 09:53:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 09:53:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 09:53:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 09:53:51,663 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 09:53:51,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:51,664 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 09:53:51,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 09:53:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 09:53:51,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 09:53:51,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:51,665 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1] [2019-08-05 09:53:51,665 INFO L418 AbstractCegarLoop]: === Iteration 21 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:51,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:51,665 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2019-08-05 09:53:51,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:51,679 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 09:53:51,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:52,074 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 09:53:52,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:52,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 09:53:52,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 09:53:52,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 09:53:52,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 09:53:52,076 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2019-08-05 09:53:52,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:52,564 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 09:53:52,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 09:53:52,564 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 09:53:52,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:52,565 INFO L225 Difference]: With dead ends: 24 [2019-08-05 09:53:52,565 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 09:53:52,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 09:53:52,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 09:53:52,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 09:53:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 09:53:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 09:53:52,568 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 09:53:52,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:52,568 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 09:53:52,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 09:53:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 09:53:52,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 09:53:52,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:52,569 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1] [2019-08-05 09:53:52,569 INFO L418 AbstractCegarLoop]: === Iteration 22 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:52,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:52,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2019-08-05 09:53:52,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:52,583 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 09:53:52,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:53,015 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 09:53:53,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:53,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 09:53:53,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 09:53:53,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 09:53:53,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 09:53:53,017 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2019-08-05 09:53:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:53,447 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 09:53:53,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 09:53:53,449 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 09:53:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:53,450 INFO L225 Difference]: With dead ends: 25 [2019-08-05 09:53:53,450 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 09:53:53,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 09:53:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 09:53:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 09:53:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 09:53:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 09:53:53,453 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 09:53:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:53,453 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 09:53:53,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 09:53:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 09:53:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 09:53:53,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:53,454 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1] [2019-08-05 09:53:53,454 INFO L418 AbstractCegarLoop]: === Iteration 23 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:53,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:53,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2019-08-05 09:53:53,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:53,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 09:53:53,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:53,811 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 09:53:53,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:53,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 09:53:53,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 09:53:53,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 09:53:53,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 09:53:53,813 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2019-08-05 09:53:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:54,256 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 09:53:54,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 09:53:54,256 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 09:53:54,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:54,257 INFO L225 Difference]: With dead ends: 26 [2019-08-05 09:53:54,257 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 09:53:54,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 09:53:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 09:53:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 09:53:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 09:53:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 09:53:54,261 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 09:53:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:54,262 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 09:53:54,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 09:53:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 09:53:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 09:53:54,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:54,263 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1] [2019-08-05 09:53:54,263 INFO L418 AbstractCegarLoop]: === Iteration 24 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:54,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:54,263 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2019-08-05 09:53:54,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:54,276 WARN L254 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 09:53:54,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:54,682 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 09:53:54,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:54,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 09:53:54,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 09:53:54,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 09:53:54,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 09:53:54,684 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2019-08-05 09:53:55,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:55,592 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 09:53:55,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 09:53:55,593 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 09:53:55,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:55,593 INFO L225 Difference]: With dead ends: 27 [2019-08-05 09:53:55,593 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 09:53:55,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 09:53:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 09:53:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 09:53:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 09:53:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 09:53:55,597 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 09:53:55,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:55,598 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 09:53:55,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 09:53:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 09:53:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 09:53:55,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:55,598 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1] [2019-08-05 09:53:55,599 INFO L418 AbstractCegarLoop]: === Iteration 25 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:55,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2019-08-05 09:53:55,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:55,613 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 09:53:55,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:56,035 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 09:53:56,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:56,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 09:53:56,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 09:53:56,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 09:53:56,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 09:53:56,037 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2019-08-05 09:53:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:56,588 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 09:53:56,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 09:53:56,589 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 09:53:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:56,590 INFO L225 Difference]: With dead ends: 28 [2019-08-05 09:53:56,590 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 09:53:56,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 09:53:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 09:53:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 09:53:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 09:53:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 09:53:56,594 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 09:53:56,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:56,594 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 09:53:56,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 09:53:56,595 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 09:53:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 09:53:56,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:56,595 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1] [2019-08-05 09:53:56,595 INFO L418 AbstractCegarLoop]: === Iteration 26 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:56,596 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2019-08-05 09:53:56,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:56,610 WARN L254 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 09:53:56,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:57,414 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 09:53:57,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:57,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 09:53:57,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 09:53:57,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 09:53:57,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 09:53:57,416 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2019-08-05 09:53:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:58,035 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 09:53:58,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 09:53:58,035 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 09:53:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:58,036 INFO L225 Difference]: With dead ends: 29 [2019-08-05 09:53:58,036 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 09:53:58,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 09:53:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 09:53:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 09:53:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 09:53:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 09:53:58,040 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 09:53:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:58,040 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 09:53:58,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 09:53:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 09:53:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 09:53:58,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:58,042 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1] [2019-08-05 09:53:58,042 INFO L418 AbstractCegarLoop]: === Iteration 27 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:58,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2019-08-05 09:53:58,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:58,056 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 09:53:58,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:58,493 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 09:53:58,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:58,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 09:53:58,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 09:53:58,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 09:53:58,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 09:53:58,495 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2019-08-05 09:53:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:59,041 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 09:53:59,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 09:53:59,042 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 09:53:59,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:59,043 INFO L225 Difference]: With dead ends: 30 [2019-08-05 09:53:59,043 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 09:53:59,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 09:53:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 09:53:59,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 09:53:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 09:53:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 09:53:59,046 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 09:53:59,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:59,046 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 09:53:59,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 09:53:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 09:53:59,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 09:53:59,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:59,047 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1] [2019-08-05 09:53:59,047 INFO L418 AbstractCegarLoop]: === Iteration 28 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:59,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:59,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2019-08-05 09:53:59,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:59,062 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 09:53:59,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:59,587 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 09:53:59,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:59,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 09:53:59,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 09:53:59,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 09:53:59,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 09:53:59,588 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2019-08-05 09:54:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:00,159 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 09:54:00,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 09:54:00,160 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 09:54:00,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:00,161 INFO L225 Difference]: With dead ends: 31 [2019-08-05 09:54:00,161 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 09:54:00,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 09:54:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 09:54:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 09:54:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 09:54:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 09:54:00,165 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 09:54:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:00,166 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 09:54:00,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 09:54:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 09:54:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 09:54:00,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:00,167 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1] [2019-08-05 09:54:00,167 INFO L418 AbstractCegarLoop]: === Iteration 29 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:00,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:00,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2019-08-05 09:54:00,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:00,180 WARN L254 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 09:54:00,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:00,674 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 09:54:00,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:00,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 09:54:00,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 09:54:00,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 09:54:00,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 09:54:00,675 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2019-08-05 09:54:01,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:01,297 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 09:54:01,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 09:54:01,298 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 09:54:01,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:01,298 INFO L225 Difference]: With dead ends: 32 [2019-08-05 09:54:01,298 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 09:54:01,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 09:54:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 09:54:01,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 09:54:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 09:54:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 09:54:01,303 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 09:54:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:01,303 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 09:54:01,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 09:54:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 09:54:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 09:54:01,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:01,304 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1] [2019-08-05 09:54:01,305 INFO L418 AbstractCegarLoop]: === Iteration 30 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:01,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:01,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2019-08-05 09:54:01,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:01,319 WARN L254 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 09:54:01,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:03,805 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 09:54:03,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:03,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 09:54:03,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 09:54:03,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 09:54:03,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 09:54:03,806 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-08-05 09:54:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:04,462 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 09:54:04,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 09:54:04,462 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 09:54:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:04,463 INFO L225 Difference]: With dead ends: 33 [2019-08-05 09:54:04,463 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 09:54:04,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 09:54:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 09:54:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 09:54:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 09:54:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 09:54:04,467 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 09:54:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:04,467 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 09:54:04,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 09:54:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 09:54:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 09:54:04,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:04,468 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1] [2019-08-05 09:54:04,468 INFO L418 AbstractCegarLoop]: === Iteration 31 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:04,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:04,469 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2019-08-05 09:54:04,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:04,483 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 09:54:04,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:05,983 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 09:54:05,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:05,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 09:54:05,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 09:54:05,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 09:54:05,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 09:54:05,985 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2019-08-05 09:54:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:06,679 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 09:54:06,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 09:54:06,679 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 09:54:06,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:06,680 INFO L225 Difference]: With dead ends: 34 [2019-08-05 09:54:06,680 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 09:54:06,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 09:54:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 09:54:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 09:54:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 09:54:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 09:54:06,684 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 09:54:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:06,684 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 09:54:06,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 09:54:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 09:54:06,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 09:54:06,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:06,685 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1] [2019-08-05 09:54:06,685 INFO L418 AbstractCegarLoop]: === Iteration 32 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:06,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:06,685 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2019-08-05 09:54:06,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:06,700 WARN L254 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 09:54:06,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:07,297 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 09:54:07,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:07,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 09:54:07,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 09:54:07,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 09:54:07,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 09:54:07,298 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2019-08-05 09:54:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:08,231 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 09:54:08,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 09:54:08,231 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 09:54:08,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:08,232 INFO L225 Difference]: With dead ends: 35 [2019-08-05 09:54:08,232 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 09:54:08,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 09:54:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 09:54:08,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 09:54:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 09:54:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 09:54:08,236 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 09:54:08,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:08,237 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 09:54:08,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 09:54:08,237 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 09:54:08,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 09:54:08,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:08,237 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1] [2019-08-05 09:54:08,238 INFO L418 AbstractCegarLoop]: === Iteration 33 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:08,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:08,238 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2019-08-05 09:54:08,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:08,253 WARN L254 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 09:54:08,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:08,883 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 09:54:08,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:08,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 09:54:08,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 09:54:08,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 09:54:08,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 09:54:08,885 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2019-08-05 09:54:09,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:09,666 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 09:54:09,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 09:54:09,667 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 09:54:09,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:09,667 INFO L225 Difference]: With dead ends: 36 [2019-08-05 09:54:09,667 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 09:54:09,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 09:54:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 09:54:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 09:54:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 09:54:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 09:54:09,672 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 09:54:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:09,672 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 09:54:09,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 09:54:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 09:54:09,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 09:54:09,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:09,673 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1] [2019-08-05 09:54:09,673 INFO L418 AbstractCegarLoop]: === Iteration 34 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:09,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:09,673 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2019-08-05 09:54:09,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:09,688 WARN L254 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 09:54:09,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:11,086 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 09:54:11,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:11,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 09:54:11,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 09:54:11,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 09:54:11,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 09:54:11,088 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2019-08-05 09:54:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:11,947 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 09:54:11,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 09:54:11,948 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 09:54:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:11,948 INFO L225 Difference]: With dead ends: 37 [2019-08-05 09:54:11,948 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 09:54:11,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 09:54:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 09:54:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 09:54:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 09:54:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 09:54:11,952 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 09:54:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:11,952 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 09:54:11,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 09:54:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 09:54:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 09:54:11,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:11,953 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1] [2019-08-05 09:54:11,953 INFO L418 AbstractCegarLoop]: === Iteration 35 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:11,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:11,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2019-08-05 09:54:11,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:11,969 WARN L254 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 09:54:11,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:12,640 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 09:54:12,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:12,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 09:54:12,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 09:54:12,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 09:54:12,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 09:54:12,641 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2019-08-05 09:54:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:13,673 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 09:54:13,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 09:54:13,674 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 09:54:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:13,675 INFO L225 Difference]: With dead ends: 38 [2019-08-05 09:54:13,675 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 09:54:13,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 09:54:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 09:54:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 09:54:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 09:54:13,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 09:54:13,678 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 09:54:13,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:13,679 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 09:54:13,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 09:54:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 09:54:13,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 09:54:13,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:13,679 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1] [2019-08-05 09:54:13,680 INFO L418 AbstractCegarLoop]: === Iteration 36 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:13,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2019-08-05 09:54:13,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:13,694 WARN L254 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 09:54:13,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:14,503 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 09:54:14,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:14,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 09:54:14,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 09:54:14,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 09:54:14,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 09:54:14,505 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2019-08-05 09:54:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:15,455 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 09:54:15,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 09:54:15,456 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 09:54:15,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:15,456 INFO L225 Difference]: With dead ends: 39 [2019-08-05 09:54:15,457 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 09:54:15,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 09:54:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 09:54:15,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 09:54:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 09:54:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 09:54:15,461 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 09:54:15,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:15,461 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 09:54:15,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 09:54:15,461 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 09:54:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 09:54:15,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:15,462 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1] [2019-08-05 09:54:15,462 INFO L418 AbstractCegarLoop]: === Iteration 37 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:15,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:15,462 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2019-08-05 09:54:15,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:15,479 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 09:54:15,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:16,407 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 09:54:16,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:16,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 09:54:16,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 09:54:16,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 09:54:16,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 09:54:16,410 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2019-08-05 09:54:17,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:17,396 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 09:54:17,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 09:54:17,396 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 09:54:17,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:17,397 INFO L225 Difference]: With dead ends: 40 [2019-08-05 09:54:17,397 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 09:54:17,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 09:54:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 09:54:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 09:54:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 09:54:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 09:54:17,401 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 09:54:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:17,401 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 09:54:17,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 09:54:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 09:54:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 09:54:17,402 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:17,402 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1] [2019-08-05 09:54:17,403 INFO L418 AbstractCegarLoop]: === Iteration 38 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:17,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:17,403 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2019-08-05 09:54:17,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:17,420 WARN L254 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 09:54:17,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:18,508 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 09:54:18,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:18,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 09:54:18,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 09:54:18,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 09:54:18,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 09:54:18,510 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2019-08-05 09:54:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:19,548 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 09:54:19,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 09:54:19,549 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 09:54:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:19,549 INFO L225 Difference]: With dead ends: 41 [2019-08-05 09:54:19,549 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 09:54:19,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 09:54:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 09:54:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 09:54:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 09:54:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 09:54:19,553 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 09:54:19,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:19,553 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 09:54:19,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 09:54:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 09:54:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 09:54:19,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:19,554 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1] [2019-08-05 09:54:19,554 INFO L418 AbstractCegarLoop]: === Iteration 39 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:19,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:19,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2019-08-05 09:54:19,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:19,570 WARN L254 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 09:54:19,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:20,431 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 09:54:20,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:20,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 09:54:20,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 09:54:20,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 09:54:20,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 09:54:20,432 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2019-08-05 09:54:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:21,522 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 09:54:21,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 09:54:21,523 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 09:54:21,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:21,523 INFO L225 Difference]: With dead ends: 42 [2019-08-05 09:54:21,523 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 09:54:21,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 09:54:21,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 09:54:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 09:54:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 09:54:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 09:54:21,527 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 09:54:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:21,527 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 09:54:21,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 09:54:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 09:54:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 09:54:21,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:21,528 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1] [2019-08-05 09:54:21,528 INFO L418 AbstractCegarLoop]: === Iteration 40 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2019-08-05 09:54:21,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:21,549 WARN L254 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 09:54:21,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:22,387 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 09:54:22,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:22,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 09:54:22,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 09:54:22,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 09:54:22,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 09:54:22,389 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2019-08-05 09:54:23,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:23,767 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 09:54:23,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 09:54:23,768 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 09:54:23,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:23,768 INFO L225 Difference]: With dead ends: 43 [2019-08-05 09:54:23,768 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 09:54:23,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 09:54:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 09:54:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 09:54:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 09:54:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 09:54:23,772 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 09:54:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:23,772 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 09:54:23,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 09:54:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 09:54:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 09:54:23,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:23,773 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1] [2019-08-05 09:54:23,773 INFO L418 AbstractCegarLoop]: === Iteration 41 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:23,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:23,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2019-08-05 09:54:23,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:23,790 WARN L254 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 09:54:23,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:24,718 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 09:54:24,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:24,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 09:54:24,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 09:54:24,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 09:54:24,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 09:54:24,720 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2019-08-05 09:54:25,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:25,941 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 09:54:25,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 09:54:25,941 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 09:54:25,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:25,942 INFO L225 Difference]: With dead ends: 44 [2019-08-05 09:54:25,942 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 09:54:25,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 09:54:25,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 09:54:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 09:54:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 09:54:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 09:54:25,945 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 09:54:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:25,945 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 09:54:25,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 09:54:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 09:54:25,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 09:54:25,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:25,946 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1] [2019-08-05 09:54:25,946 INFO L418 AbstractCegarLoop]: === Iteration 42 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:25,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:25,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2019-08-05 09:54:25,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:25,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 169 conjunts are in the unsatisfiable core [2019-08-05 09:54:25,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:26,923 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 09:54:26,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:26,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 09:54:26,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 09:54:26,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 09:54:26,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 09:54:26,925 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2019-08-05 09:54:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:28,269 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 09:54:28,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 09:54:28,270 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 09:54:28,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:28,270 INFO L225 Difference]: With dead ends: 45 [2019-08-05 09:54:28,270 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 09:54:28,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 09:54:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 09:54:28,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 09:54:28,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 09:54:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 09:54:28,273 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 09:54:28,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:28,273 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 09:54:28,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 09:54:28,273 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 09:54:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 09:54:28,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:28,274 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1] [2019-08-05 09:54:28,274 INFO L418 AbstractCegarLoop]: === Iteration 43 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:28,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:28,275 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2019-08-05 09:54:28,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:28,291 WARN L254 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-05 09:54:28,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:29,281 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 09:54:29,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:29,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 09:54:29,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 09:54:29,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 09:54:29,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 09:54:29,283 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2019-08-05 09:54:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:30,590 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 09:54:30,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 09:54:30,590 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 09:54:30,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:30,591 INFO L225 Difference]: With dead ends: 46 [2019-08-05 09:54:30,591 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 09:54:30,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 09:54:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 09:54:30,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 09:54:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 09:54:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 09:54:30,595 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 09:54:30,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:30,595 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 09:54:30,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 09:54:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 09:54:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 09:54:30,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:30,596 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1] [2019-08-05 09:54:30,596 INFO L418 AbstractCegarLoop]: === Iteration 44 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:30,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:30,596 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2019-08-05 09:54:30,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:30,615 WARN L254 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-05 09:54:30,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:31,681 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 09:54:31,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:31,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 09:54:31,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 09:54:31,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 09:54:31,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 09:54:31,682 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2019-08-05 09:54:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:33,066 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 09:54:33,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 09:54:33,067 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 09:54:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:33,068 INFO L225 Difference]: With dead ends: 47 [2019-08-05 09:54:33,068 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 09:54:33,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 09:54:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 09:54:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 09:54:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 09:54:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 09:54:33,071 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 09:54:33,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:33,071 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 09:54:33,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 09:54:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 09:54:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 09:54:33,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:33,072 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1] [2019-08-05 09:54:33,072 INFO L418 AbstractCegarLoop]: === Iteration 45 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:33,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:33,072 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2019-08-05 09:54:33,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:33,087 WARN L254 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 181 conjunts are in the unsatisfiable core [2019-08-05 09:54:33,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:34,229 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 09:54:34,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:34,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 09:54:34,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 09:54:34,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 09:54:34,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 09:54:34,230 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2019-08-05 09:54:35,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:35,677 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 09:54:35,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 09:54:35,677 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 09:54:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:35,678 INFO L225 Difference]: With dead ends: 48 [2019-08-05 09:54:35,678 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 09:54:35,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 09:54:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 09:54:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 09:54:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 09:54:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 09:54:35,681 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 09:54:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:35,682 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 09:54:35,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 09:54:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 09:54:35,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 09:54:35,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:35,683 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1] [2019-08-05 09:54:35,683 INFO L418 AbstractCegarLoop]: === Iteration 46 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:35,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:35,683 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2019-08-05 09:54:35,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:35,699 WARN L254 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 185 conjunts are in the unsatisfiable core [2019-08-05 09:54:35,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:36,813 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 09:54:36,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:36,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 09:54:36,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 09:54:36,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 09:54:36,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 09:54:36,815 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2019-08-05 09:54:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:38,339 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 09:54:38,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 09:54:38,340 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 09:54:38,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:38,340 INFO L225 Difference]: With dead ends: 49 [2019-08-05 09:54:38,340 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 09:54:38,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 09:54:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 09:54:38,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 09:54:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 09:54:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 09:54:38,342 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 09:54:38,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:38,342 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 09:54:38,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 09:54:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 09:54:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 09:54:38,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:38,343 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1] [2019-08-05 09:54:38,343 INFO L418 AbstractCegarLoop]: === Iteration 47 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:38,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:38,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2019-08-05 09:54:38,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:38,366 WARN L254 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-05 09:54:38,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:39,697 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 09:54:39,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:39,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 09:54:39,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 09:54:39,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 09:54:39,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 09:54:39,698 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2019-08-05 09:54:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:41,268 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 09:54:41,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 09:54:41,269 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 09:54:41,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:41,270 INFO L225 Difference]: With dead ends: 50 [2019-08-05 09:54:41,270 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 09:54:41,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 09:54:41,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 09:54:41,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 09:54:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 09:54:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 09:54:41,272 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 09:54:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:41,273 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 09:54:41,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 09:54:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 09:54:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 09:54:41,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:41,274 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1] [2019-08-05 09:54:41,274 INFO L418 AbstractCegarLoop]: === Iteration 48 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:41,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:41,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2019-08-05 09:54:41,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:41,297 WARN L254 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 193 conjunts are in the unsatisfiable core [2019-08-05 09:54:41,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:42,436 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 09:54:42,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:42,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 09:54:42,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 09:54:42,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 09:54:42,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 09:54:42,437 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2019-08-05 09:54:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:44,246 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 09:54:44,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 09:54:44,247 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 09:54:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:44,248 INFO L225 Difference]: With dead ends: 51 [2019-08-05 09:54:44,248 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 09:54:44,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 09:54:44,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 09:54:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 09:54:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 09:54:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 09:54:44,251 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 09:54:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:44,252 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 09:54:44,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 09:54:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 09:54:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 09:54:44,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:44,252 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1] [2019-08-05 09:54:44,253 INFO L418 AbstractCegarLoop]: === Iteration 49 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:44,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:44,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2019-08-05 09:54:44,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:44,273 WARN L254 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-05 09:54:44,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:45,410 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 09:54:45,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:45,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 09:54:45,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 09:54:45,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 09:54:45,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 09:54:45,412 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2019-08-05 09:54:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:47,117 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 09:54:47,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 09:54:47,118 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 09:54:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:47,118 INFO L225 Difference]: With dead ends: 52 [2019-08-05 09:54:47,119 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 09:54:47,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 09:54:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 09:54:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 09:54:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 09:54:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 09:54:47,122 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 09:54:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:47,123 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 09:54:47,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 09:54:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 09:54:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 09:54:47,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:47,123 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1] [2019-08-05 09:54:47,124 INFO L418 AbstractCegarLoop]: === Iteration 50 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:47,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:47,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2019-08-05 09:54:47,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:47,141 WARN L254 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-05 09:54:47,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:48,310 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 09:54:48,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:48,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 09:54:48,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 09:54:48,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 09:54:48,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 09:54:48,311 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2019-08-05 09:54:50,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:50,192 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 09:54:50,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 09:54:50,194 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 09:54:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:50,195 INFO L225 Difference]: With dead ends: 53 [2019-08-05 09:54:50,195 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 09:54:50,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 09:54:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 09:54:50,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 09:54:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 09:54:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 09:54:50,197 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 09:54:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:50,198 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 09:54:50,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 09:54:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 09:54:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 09:54:50,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:50,198 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1] [2019-08-05 09:54:50,199 INFO L418 AbstractCegarLoop]: === Iteration 51 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:50,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:50,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2019-08-05 09:54:50,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:50,223 WARN L254 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 205 conjunts are in the unsatisfiable core [2019-08-05 09:54:50,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:51,552 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 09:54:51,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:51,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 09:54:51,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 09:54:51,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 09:54:51,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 09:54:51,554 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2019-08-05 09:54:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:53,414 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 09:54:53,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 09:54:53,415 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 09:54:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:53,416 INFO L225 Difference]: With dead ends: 54 [2019-08-05 09:54:53,416 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 09:54:53,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 09:54:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 09:54:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 09:54:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 09:54:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 09:54:53,419 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 09:54:53,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:53,419 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 09:54:53,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 09:54:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 09:54:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 09:54:53,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:53,420 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1] [2019-08-05 09:54:53,421 INFO L418 AbstractCegarLoop]: === Iteration 52 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:53,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:53,421 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2019-08-05 09:54:53,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:53,447 WARN L254 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-05 09:54:53,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:55,088 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 09:54:55,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:55,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 09:54:55,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 09:54:55,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 09:54:55,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 09:54:55,089 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2019-08-05 09:54:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:57,032 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 09:54:57,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 09:54:57,032 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 09:54:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:57,033 INFO L225 Difference]: With dead ends: 55 [2019-08-05 09:54:57,033 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 09:54:57,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 09:54:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 09:54:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 09:54:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 09:54:57,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 09:54:57,036 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 09:54:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:57,036 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 09:54:57,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 09:54:57,037 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 09:54:57,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 09:54:57,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:57,037 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1] [2019-08-05 09:54:57,038 INFO L418 AbstractCegarLoop]: === Iteration 53 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:57,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:57,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2019-08-05 09:54:57,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:57,064 WARN L254 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-05 09:54:57,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:58,431 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 09:54:58,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:58,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 09:54:58,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 09:54:58,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 09:54:58,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 09:54:58,433 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2019-08-05 09:55:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:00,636 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 09:55:00,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 09:55:00,637 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 09:55:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:00,637 INFO L225 Difference]: With dead ends: 56 [2019-08-05 09:55:00,637 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 09:55:00,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 09:55:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 09:55:00,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 09:55:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 09:55:00,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 09:55:00,641 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 09:55:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:00,641 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 09:55:00,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 09:55:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 09:55:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 09:55:00,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:00,642 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1] [2019-08-05 09:55:00,642 INFO L418 AbstractCegarLoop]: === Iteration 54 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:00,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:00,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2019-08-05 09:55:00,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:00,670 WARN L254 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 217 conjunts are in the unsatisfiable core [2019-08-05 09:55:00,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:02,079 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 09:55:02,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:02,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 09:55:02,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 09:55:02,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 09:55:02,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 09:55:02,081 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-08-05 09:55:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:04,345 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 09:55:04,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 09:55:04,346 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 09:55:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:04,347 INFO L225 Difference]: With dead ends: 57 [2019-08-05 09:55:04,347 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 09:55:04,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 09:55:04,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 09:55:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 09:55:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 09:55:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 09:55:04,349 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 09:55:04,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:04,350 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 09:55:04,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 09:55:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 09:55:04,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 09:55:04,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:04,351 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1] [2019-08-05 09:55:04,351 INFO L418 AbstractCegarLoop]: === Iteration 55 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:04,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2019-08-05 09:55:04,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:04,380 WARN L254 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 221 conjunts are in the unsatisfiable core [2019-08-05 09:55:04,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:06,042 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 09:55:06,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:06,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 09:55:06,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 09:55:06,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 09:55:06,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 09:55:06,043 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2019-08-05 09:55:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:08,145 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 09:55:08,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 09:55:08,146 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 09:55:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:08,147 INFO L225 Difference]: With dead ends: 58 [2019-08-05 09:55:08,147 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 09:55:08,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 09:55:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 09:55:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 09:55:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 09:55:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 09:55:08,149 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 09:55:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:08,150 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 09:55:08,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 09:55:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 09:55:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 09:55:08,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:08,151 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1] [2019-08-05 09:55:08,151 INFO L418 AbstractCegarLoop]: === Iteration 56 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:08,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:08,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2019-08-05 09:55:08,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:08,170 WARN L254 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-05 09:55:08,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:09,807 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 09:55:09,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:09,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 09:55:09,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 09:55:09,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 09:55:09,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 09:55:09,808 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2019-08-05 09:55:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:12,037 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 09:55:12,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 09:55:12,038 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 09:55:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:12,039 INFO L225 Difference]: With dead ends: 59 [2019-08-05 09:55:12,039 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 09:55:12,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 09:55:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 09:55:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 09:55:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 09:55:12,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 09:55:12,041 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 09:55:12,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:12,041 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 09:55:12,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 09:55:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 09:55:12,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 09:55:12,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:12,042 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1] [2019-08-05 09:55:12,042 INFO L418 AbstractCegarLoop]: === Iteration 57 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:12,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:12,043 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2019-08-05 09:55:12,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:12,071 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 229 conjunts are in the unsatisfiable core [2019-08-05 09:55:12,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:13,600 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 09:55:13,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:13,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 09:55:13,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 09:55:13,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 09:55:13,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 09:55:13,601 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2019-08-05 09:55:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:16,110 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 09:55:16,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 09:55:16,110 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2019-08-05 09:55:16,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:16,111 INFO L225 Difference]: With dead ends: 60 [2019-08-05 09:55:16,112 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 09:55:16,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 09:55:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 09:55:16,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 09:55:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 09:55:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 09:55:16,115 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 09:55:16,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:16,115 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 09:55:16,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 09:55:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 09:55:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 09:55:16,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:16,116 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1] [2019-08-05 09:55:16,116 INFO L418 AbstractCegarLoop]: === Iteration 58 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:16,116 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2019-08-05 09:55:16,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:16,142 WARN L254 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 233 conjunts are in the unsatisfiable core [2019-08-05 09:55:16,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:17,692 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 09:55:17,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:17,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 09:55:17,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 09:55:17,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 09:55:17,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 09:55:17,694 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2019-08-05 09:55:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:20,239 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 09:55:20,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 09:55:20,240 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-08-05 09:55:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:20,240 INFO L225 Difference]: With dead ends: 61 [2019-08-05 09:55:20,241 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 09:55:20,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 09:55:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 09:55:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 09:55:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 09:55:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 09:55:20,244 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 09:55:20,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:20,245 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 09:55:20,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 09:55:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 09:55:20,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 09:55:20,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:20,246 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1] [2019-08-05 09:55:20,246 INFO L418 AbstractCegarLoop]: === Iteration 59 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:20,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:20,246 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2019-08-05 09:55:20,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:20,275 WARN L254 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-05 09:55:20,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:22,236 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 09:55:22,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:22,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 09:55:22,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 09:55:22,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 09:55:22,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 09:55:22,238 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2019-08-05 09:55:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:24,860 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 09:55:24,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 09:55:24,862 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2019-08-05 09:55:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:24,863 INFO L225 Difference]: With dead ends: 62 [2019-08-05 09:55:24,863 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 09:55:24,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 09:55:24,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 09:55:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 09:55:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 09:55:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 09:55:24,865 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 09:55:24,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:24,865 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 09:55:24,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 09:55:24,865 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 09:55:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 09:55:24,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:24,866 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1] [2019-08-05 09:55:24,866 INFO L418 AbstractCegarLoop]: === Iteration 60 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:24,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:24,866 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2019-08-05 09:55:24,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:24,891 WARN L254 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 241 conjunts are in the unsatisfiable core [2019-08-05 09:55:24,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:26,598 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 09:55:26,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:26,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 09:55:26,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 09:55:26,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 09:55:26,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 09:55:26,599 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2019-08-05 09:55:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:29,137 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 09:55:29,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 09:55:29,137 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2019-08-05 09:55:29,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:29,138 INFO L225 Difference]: With dead ends: 63 [2019-08-05 09:55:29,138 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 09:55:29,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 09:55:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 09:55:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 09:55:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 09:55:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 09:55:29,141 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 09:55:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:29,141 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 09:55:29,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 09:55:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 09:55:29,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 09:55:29,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:29,141 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1] [2019-08-05 09:55:29,142 INFO L418 AbstractCegarLoop]: === Iteration 61 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:29,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:29,142 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2019-08-05 09:55:29,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:29,175 WARN L254 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 245 conjunts are in the unsatisfiable core [2019-08-05 09:55:29,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:31,126 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 09:55:31,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:31,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 09:55:31,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 09:55:31,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 09:55:31,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 09:55:31,127 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2019-08-05 09:55:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:33,763 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 09:55:33,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 09:55:33,764 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2019-08-05 09:55:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:33,765 INFO L225 Difference]: With dead ends: 64 [2019-08-05 09:55:33,765 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 09:55:33,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 09:55:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 09:55:33,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 09:55:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 09:55:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 09:55:33,767 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 09:55:33,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:33,768 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 09:55:33,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 09:55:33,768 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 09:55:33,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 09:55:33,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:33,769 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1] [2019-08-05 09:55:33,769 INFO L418 AbstractCegarLoop]: === Iteration 62 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:33,770 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2019-08-05 09:55:33,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:33,804 WARN L254 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-05 09:55:33,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:36,031 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 09:55:36,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:36,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 09:55:36,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 09:55:36,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 09:55:36,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 09:55:36,032 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2019-08-05 09:55:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:38,748 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 09:55:38,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 09:55:38,749 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2019-08-05 09:55:38,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:38,750 INFO L225 Difference]: With dead ends: 65 [2019-08-05 09:55:38,750 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 09:55:38,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 09:55:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 09:55:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 09:55:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 09:55:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 09:55:38,752 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 09:55:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:38,753 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 09:55:38,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 09:55:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 09:55:38,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 09:55:38,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:38,754 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1] [2019-08-05 09:55:38,754 INFO L418 AbstractCegarLoop]: === Iteration 63 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:38,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2019-08-05 09:55:38,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:38,779 WARN L254 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 253 conjunts are in the unsatisfiable core [2019-08-05 09:55:38,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:40,842 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 09:55:40,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:40,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 09:55:40,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 09:55:40,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 09:55:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 09:55:40,844 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2019-08-05 09:55:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:43,654 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 09:55:43,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 09:55:43,655 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2019-08-05 09:55:43,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:43,655 INFO L225 Difference]: With dead ends: 66 [2019-08-05 09:55:43,655 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 09:55:43,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 09:55:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 09:55:43,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 09:55:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 09:55:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 09:55:43,659 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 09:55:43,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:43,659 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 09:55:43,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 09:55:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 09:55:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 09:55:43,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:43,660 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1] [2019-08-05 09:55:43,660 INFO L418 AbstractCegarLoop]: === Iteration 64 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2019-08-05 09:55:43,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:43,695 WARN L254 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 257 conjunts are in the unsatisfiable core [2019-08-05 09:55:43,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:45,777 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 09:55:45,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:45,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 09:55:45,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 09:55:45,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 09:55:45,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 09:55:45,779 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2019-08-05 09:55:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:48,668 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 09:55:48,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 09:55:48,668 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2019-08-05 09:55:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:48,669 INFO L225 Difference]: With dead ends: 67 [2019-08-05 09:55:48,669 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 09:55:48,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 09:55:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 09:55:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 09:55:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 09:55:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 09:55:48,672 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 09:55:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:48,672 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 09:55:48,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 09:55:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 09:55:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 09:55:48,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:48,673 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1] [2019-08-05 09:55:48,673 INFO L418 AbstractCegarLoop]: === Iteration 65 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:48,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:48,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2019-08-05 09:55:48,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:48,709 WARN L254 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-05 09:55:48,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:50,948 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 09:55:50,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:50,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 09:55:50,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 09:55:50,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 09:55:50,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 09:55:50,950 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2019-08-05 09:55:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:53,932 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 09:55:53,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 09:55:53,932 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2019-08-05 09:55:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:53,933 INFO L225 Difference]: With dead ends: 68 [2019-08-05 09:55:53,933 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 09:55:53,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 09:55:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 09:55:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 09:55:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 09:55:53,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 09:55:53,936 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 09:55:53,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:53,937 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 09:55:53,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 09:55:53,937 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 09:55:53,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 09:55:53,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:53,938 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1] [2019-08-05 09:55:53,938 INFO L418 AbstractCegarLoop]: === Iteration 66 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:53,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:53,938 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2019-08-05 09:55:53,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:53,969 WARN L254 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 265 conjunts are in the unsatisfiable core [2019-08-05 09:55:53,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:56,254 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 09:55:56,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:56,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 09:55:56,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 09:55:56,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 09:55:56,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 09:55:56,255 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2019-08-05 09:55:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:59,334 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 09:55:59,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 09:55:59,334 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2019-08-05 09:55:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:59,335 INFO L225 Difference]: With dead ends: 69 [2019-08-05 09:55:59,335 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 09:55:59,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 09:55:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 09:55:59,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 09:55:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 09:55:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 09:55:59,338 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 09:55:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:59,338 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 09:55:59,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 09:55:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 09:55:59,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 09:55:59,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:59,339 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1] [2019-08-05 09:55:59,340 INFO L418 AbstractCegarLoop]: === Iteration 67 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:59,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:59,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2019-08-05 09:55:59,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:59,370 WARN L254 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 269 conjunts are in the unsatisfiable core [2019-08-05 09:55:59,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:01,799 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 09:56:01,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:01,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 09:56:01,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 09:56:01,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 09:56:01,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 09:56:01,800 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2019-08-05 09:56:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:04,965 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 09:56:04,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 09:56:04,966 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2019-08-05 09:56:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:04,966 INFO L225 Difference]: With dead ends: 70 [2019-08-05 09:56:04,967 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 09:56:04,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 09:56:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 09:56:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 09:56:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 09:56:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 09:56:04,969 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 09:56:04,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:04,969 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 09:56:04,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 09:56:04,970 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 09:56:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 09:56:04,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:04,970 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1] [2019-08-05 09:56:04,970 INFO L418 AbstractCegarLoop]: === Iteration 68 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:04,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:04,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2019-08-05 09:56:04,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:05,003 WARN L254 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-05 09:56:05,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:07,404 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 09:56:07,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:07,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 09:56:07,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 09:56:07,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 09:56:07,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 09:56:07,405 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2019-08-05 09:56:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:10,814 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 09:56:10,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 09:56:10,815 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2019-08-05 09:56:10,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:10,815 INFO L225 Difference]: With dead ends: 71 [2019-08-05 09:56:10,815 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 09:56:10,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 09:56:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 09:56:10,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 09:56:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 09:56:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 09:56:10,817 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 09:56:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:10,817 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 09:56:10,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 09:56:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 09:56:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 09:56:10,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:10,818 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1] [2019-08-05 09:56:10,818 INFO L418 AbstractCegarLoop]: === Iteration 69 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:10,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:10,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2019-08-05 09:56:10,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:10,858 WARN L254 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 277 conjunts are in the unsatisfiable core [2019-08-05 09:56:10,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:13,345 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 09:56:13,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:13,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 09:56:13,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 09:56:13,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 09:56:13,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 09:56:13,346 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2019-08-05 09:56:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:16,847 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 09:56:16,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 09:56:16,848 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2019-08-05 09:56:16,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:16,849 INFO L225 Difference]: With dead ends: 72 [2019-08-05 09:56:16,849 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 09:56:16,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 09:56:16,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 09:56:16,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 09:56:16,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 09:56:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 09:56:16,852 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 09:56:16,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:16,852 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 09:56:16,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 09:56:16,852 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 09:56:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 09:56:16,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:16,853 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1] [2019-08-05 09:56:16,853 INFO L418 AbstractCegarLoop]: === Iteration 70 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:16,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:16,853 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2019-08-05 09:56:16,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:16,888 WARN L254 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 281 conjunts are in the unsatisfiable core [2019-08-05 09:56:16,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:19,183 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 09:56:19,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:19,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 09:56:19,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 09:56:19,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 09:56:19,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 09:56:19,184 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2019-08-05 09:56:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:22,787 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 09:56:22,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 09:56:22,787 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2019-08-05 09:56:22,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:22,789 INFO L225 Difference]: With dead ends: 73 [2019-08-05 09:56:22,789 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 09:56:22,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 09:56:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 09:56:22,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 09:56:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 09:56:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 09:56:22,792 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 09:56:22,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:22,792 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 09:56:22,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 09:56:22,792 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 09:56:22,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 09:56:22,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:22,793 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1] [2019-08-05 09:56:22,793 INFO L418 AbstractCegarLoop]: === Iteration 71 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:22,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:22,793 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2019-08-05 09:56:22,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:22,822 WARN L254 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-05 09:56:22,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:25,103 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 09:56:25,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:25,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 09:56:25,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 09:56:25,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 09:56:25,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 09:56:25,105 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2019-08-05 09:56:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:28,833 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 09:56:28,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 09:56:28,834 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2019-08-05 09:56:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:28,835 INFO L225 Difference]: With dead ends: 74 [2019-08-05 09:56:28,835 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 09:56:28,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 09:56:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 09:56:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 09:56:28,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 09:56:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 09:56:28,838 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 09:56:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:28,838 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 09:56:28,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 09:56:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 09:56:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 09:56:28,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:28,839 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1] [2019-08-05 09:56:28,840 INFO L418 AbstractCegarLoop]: === Iteration 72 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:28,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2019-08-05 09:56:28,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:28,881 WARN L254 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 289 conjunts are in the unsatisfiable core [2019-08-05 09:56:28,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:31,480 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 09:56:31,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:31,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 09:56:31,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 09:56:31,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 09:56:31,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 09:56:31,481 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2019-08-05 09:56:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:35,087 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 09:56:35,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 09:56:35,087 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2019-08-05 09:56:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:35,088 INFO L225 Difference]: With dead ends: 75 [2019-08-05 09:56:35,088 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 09:56:35,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 09:56:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 09:56:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 09:56:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 09:56:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 09:56:35,092 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 09:56:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:35,092 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 09:56:35,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 09:56:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 09:56:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 09:56:35,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:35,093 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1] [2019-08-05 09:56:35,094 INFO L418 AbstractCegarLoop]: === Iteration 73 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:35,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2019-08-05 09:56:35,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:35,139 WARN L254 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 293 conjunts are in the unsatisfiable core [2019-08-05 09:56:35,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:37,925 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 09:56:37,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:37,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 09:56:37,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 09:56:37,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 09:56:37,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 09:56:37,926 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2019-08-05 09:56:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:41,835 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 09:56:41,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 09:56:41,836 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2019-08-05 09:56:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:41,837 INFO L225 Difference]: With dead ends: 76 [2019-08-05 09:56:41,837 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 09:56:41,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 09:56:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 09:56:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 09:56:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 09:56:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 09:56:41,841 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 09:56:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:41,841 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 09:56:41,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 09:56:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 09:56:41,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 09:56:41,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:41,842 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1] [2019-08-05 09:56:41,842 INFO L418 AbstractCegarLoop]: === Iteration 74 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:41,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:41,842 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2019-08-05 09:56:41,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:41,876 WARN L254 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-05 09:56:41,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:44,341 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 09:56:44,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:44,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 09:56:44,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 09:56:44,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 09:56:44,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 09:56:44,342 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2019-08-05 09:56:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:48,310 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 09:56:48,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 09:56:48,311 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2019-08-05 09:56:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:48,312 INFO L225 Difference]: With dead ends: 77 [2019-08-05 09:56:48,312 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 09:56:48,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 09:56:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 09:56:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 09:56:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 09:56:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 09:56:48,315 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 09:56:48,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:48,315 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 09:56:48,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 09:56:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 09:56:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 09:56:48,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:48,316 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1] [2019-08-05 09:56:48,316 INFO L418 AbstractCegarLoop]: === Iteration 75 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:48,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:48,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2019-08-05 09:56:48,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:48,369 WARN L254 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 301 conjunts are in the unsatisfiable core [2019-08-05 09:56:48,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:51,272 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 09:56:51,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:51,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 09:56:51,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 09:56:51,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 09:56:51,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 09:56:51,274 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2019-08-05 09:56:55,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:55,425 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 09:56:55,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 09:56:55,425 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2019-08-05 09:56:55,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:55,426 INFO L225 Difference]: With dead ends: 78 [2019-08-05 09:56:55,426 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 09:56:55,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 09:56:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 09:56:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 09:56:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 09:56:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 09:56:55,429 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 09:56:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:55,429 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 09:56:55,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 09:56:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 09:56:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 09:56:55,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:55,430 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1] [2019-08-05 09:56:55,430 INFO L418 AbstractCegarLoop]: === Iteration 76 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:55,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:55,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2019-08-05 09:56:55,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:55,478 WARN L254 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 305 conjunts are in the unsatisfiable core [2019-08-05 09:56:55,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:58,283 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 09:56:58,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:58,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 09:56:58,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 09:56:58,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 09:56:58,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 09:56:58,284 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2019-08-05 09:57:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:57:02,512 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 09:57:02,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 09:57:02,512 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2019-08-05 09:57:02,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:57:02,513 INFO L225 Difference]: With dead ends: 79 [2019-08-05 09:57:02,513 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 09:57:02,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 09:57:02,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 09:57:02,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 09:57:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 09:57:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 09:57:02,516 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 09:57:02,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:57:02,516 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 09:57:02,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 09:57:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 09:57:02,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 09:57:02,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:57:02,517 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1] [2019-08-05 09:57:02,517 INFO L418 AbstractCegarLoop]: === Iteration 77 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:57:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:57:02,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2019-08-05 09:57:02,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:57:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:57:02,554 WARN L254 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 309 conjunts are in the unsatisfiable core [2019-08-05 09:57:02,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:57:05,182 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 09:57:05,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:57:05,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 09:57:05,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 09:57:05,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 09:57:05,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 09:57:05,184 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2019-08-05 09:57:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:57:09,462 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 09:57:09,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 09:57:09,463 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2019-08-05 09:57:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:57:09,464 INFO L225 Difference]: With dead ends: 80 [2019-08-05 09:57:09,464 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 09:57:09,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 09:57:09,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 09:57:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 09:57:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 09:57:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 09:57:09,466 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 09:57:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:57:09,466 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 09:57:09,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 09:57:09,466 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 09:57:09,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 09:57:09,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:57:09,467 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1] [2019-08-05 09:57:09,467 INFO L418 AbstractCegarLoop]: === Iteration 78 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:57:09,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:57:09,467 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2019-08-05 09:57:09,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:57:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:57:09,503 WARN L254 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 313 conjunts are in the unsatisfiable core [2019-08-05 09:57:09,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:57:14,398 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 09:57:14,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:57:14,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 09:57:14,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 09:57:14,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 09:57:14,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 09:57:14,399 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2019-08-05 09:57:19,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:57:19,062 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 09:57:19,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 09:57:19,063 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2019-08-05 09:57:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:57:19,063 INFO L225 Difference]: With dead ends: 81 [2019-08-05 09:57:19,064 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 09:57:19,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 09:57:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 09:57:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 09:57:19,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 09:57:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 09:57:19,066 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 09:57:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:57:19,067 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 09:57:19,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 09:57:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 09:57:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 09:57:19,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:57:19,068 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1] [2019-08-05 09:57:19,068 INFO L418 AbstractCegarLoop]: === Iteration 79 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:57:19,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:57:19,068 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2019-08-05 09:57:19,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:57:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:57:19,109 WARN L254 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 317 conjunts are in the unsatisfiable core [2019-08-05 09:57:19,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:57:21,882 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 09:57:21,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:57:21,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 09:57:21,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 09:57:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 09:57:21,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 09:57:21,883 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2019-08-05 09:57:26,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:57:26,667 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 09:57:26,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 09:57:26,667 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2019-08-05 09:57:26,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:57:26,668 INFO L225 Difference]: With dead ends: 82 [2019-08-05 09:57:26,668 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 09:57:26,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 09:57:26,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 09:57:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 09:57:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 09:57:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 09:57:26,671 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 09:57:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:57:26,671 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 09:57:26,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 09:57:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 09:57:26,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 09:57:26,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:57:26,672 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1] [2019-08-05 09:57:26,672 INFO L418 AbstractCegarLoop]: === Iteration 80 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:57:26,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:57:26,673 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2019-08-05 09:57:26,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:57:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:57:26,729 WARN L254 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 321 conjunts are in the unsatisfiable core [2019-08-05 09:57:26,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:57:29,902 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 09:57:29,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:57:29,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 09:57:29,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 09:57:29,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 09:57:29,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 09:57:29,903 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2019-08-05 09:57:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:57:34,528 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 09:57:34,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 09:57:34,528 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2019-08-05 09:57:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:57:34,529 INFO L225 Difference]: With dead ends: 83 [2019-08-05 09:57:34,529 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 09:57:34,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 09:57:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 09:57:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 09:57:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 09:57:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 09:57:34,532 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 09:57:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:57:34,532 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 09:57:34,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 09:57:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 09:57:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 09:57:34,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:57:34,533 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1] [2019-08-05 09:57:34,533 INFO L418 AbstractCegarLoop]: === Iteration 81 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:57:34,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:57:34,534 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2019-08-05 09:57:34,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:57:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:57:34,585 WARN L254 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 325 conjunts are in the unsatisfiable core [2019-08-05 09:57:34,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:57:37,609 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 09:57:37,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:57:37,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 09:57:37,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 09:57:37,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 09:57:37,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 09:57:37,610 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2019-08-05 09:57:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:57:42,351 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 09:57:42,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 09:57:42,351 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2019-08-05 09:57:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:57:42,352 INFO L225 Difference]: With dead ends: 84 [2019-08-05 09:57:42,352 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 09:57:42,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 09:57:42,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 09:57:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 09:57:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 09:57:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 09:57:42,355 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 09:57:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:57:42,355 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 09:57:42,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 09:57:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 09:57:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 09:57:42,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:57:42,356 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1] [2019-08-05 09:57:42,356 INFO L418 AbstractCegarLoop]: === Iteration 82 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:57:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:57:42,356 INFO L82 PathProgramCache]: Analyzing trace with hash 723579617, now seen corresponding path program 81 times [2019-08-05 09:57:42,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:57:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:57:42,404 WARN L254 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 329 conjunts are in the unsatisfiable core [2019-08-05 09:57:42,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:57:46,651 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 09:57:46,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:57:46,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 09:57:46,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 09:57:46,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 09:57:46,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 09:57:46,652 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. Received shutdown request... [2019-08-05 09:57:51,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 09:57:51,022 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 09:57:51,027 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 09:57:51,028 INFO L202 PluginConnector]: Adding new model test2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 09:57:51 BoogieIcfgContainer [2019-08-05 09:57:51,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 09:57:51,030 INFO L168 Benchmark]: Toolchain (without parser) took 249766.93 ms. Allocated memory was 139.5 MB in the beginning and 230.7 MB in the end (delta: 91.2 MB). Free memory was 109.4 MB in the beginning and 161.9 MB in the end (delta: -52.5 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. [2019-08-05 09:57:51,031 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.34 ms. Allocated memory is still 139.5 MB. Free memory was 110.5 MB in the beginning and 110.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 09:57:51,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.13 ms. Allocated memory is still 139.5 MB. Free memory was 109.2 MB in the beginning and 107.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 09:57:51,032 INFO L168 Benchmark]: Boogie Preprocessor took 25.14 ms. Allocated memory is still 139.5 MB. Free memory was 107.4 MB in the beginning and 106.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 09:57:51,033 INFO L168 Benchmark]: RCFGBuilder took 286.71 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 97.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-08-05 09:57:51,034 INFO L168 Benchmark]: TraceAbstraction took 249408.61 ms. Allocated memory was 139.5 MB in the beginning and 230.7 MB in the end (delta: 91.2 MB). Free memory was 96.9 MB in the beginning and 161.9 MB in the end (delta: -64.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-08-05 09:57:51,037 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.34 ms. Allocated memory is still 139.5 MB. Free memory was 110.5 MB in the beginning and 110.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 40.13 ms. Allocated memory is still 139.5 MB. Free memory was 109.2 MB in the beginning and 107.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 25.14 ms. Allocated memory is still 139.5 MB. Free memory was 107.4 MB in the beginning and 106.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 286.71 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 97.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249408.61 ms. Allocated memory was 139.5 MB in the beginning and 230.7 MB in the end (delta: 91.2 MB). Free memory was 96.9 MB in the beginning and 161.9 MB in the end (delta: -64.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15). Cancelled while BasicCegarLoop was constructing difference of abstraction (84states) and FLOYD_HOARE automaton (currently 76 states, 84 states before enhancement),while ReachableStatesComputation was computing reachable states (74 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 249.3s OverallTime, 82 OverallIterations, 81 TraceHistogramMax, 139.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 164 SDtfs, 1 SDslu, 1 SDs, 0 SdLazy, 193152 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 115.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3403 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 106.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=81, 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, 81 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 108.0s InterpolantComputationTime, 3485 NumberOfCodeBlocks, 3485 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 3403 ConstructedInterpolants, 0 QuantifiedInterpolants, 1310155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 13858 ConjunctsInSsa, 13694 ConjunctsInUnsatCore, 82 InterpolantComputations, 1 PerfectInterpolantSequences, 0/91881 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown